Article

Free access

Random walks on weighted graphs, and applications to on-line algorithms

Authors:

D. Coppersmith,

P. Doyle,

P. Raghavan,

M. SnirAuthors Info & Claims

STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of Computing

Pages 369 - 378

https://doi.org/10.1145/100216.100266

Published: 01 April 1990 Publication History

PDF eReader

References

[1]

L.E. Baum and J.A. Eagon. An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bull. Amer. Math. Soc., 73:363-363, 1967.

Crossref

Google Scholar

[2]

S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, and A. Wigderson. On the power of randomization in on-line algorithms. To appear in the Proc. of the 22nd ACM Symposium on Theory of Computing, May 1990, 1990.

Digital Library

Google Scholar

[3]

P. Berman, H.J. Karloff, and G. TArdos. A competitive 3-server algorithm. In Proc. First ACM-SIAM Symposium on Discrete Algorithms, pages 280-290, 1990.

Digital Library

Google Scholar

[4]

A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Nineteenth Annual ACM Symposium on Theory of Computing, pages 373-382, 1987.

Digital Library

Google Scholar

[5]

R. Bott and R. J. Duffin. On the algebra of networks. Trans. Amer. Math. Soc., 74:99-109, 1953.

Crossref

Google Scholar

[6]

A. K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 574-586, Seattle, May 1989.

Digital Library

Google Scholar

[7]

M. Chrobak, H.J. Karloff, T. Payne, and S. Viswanathan. New results on server problems. In Proc. First ACM-SIAM Symposium on Discrete Algorithms, pages 291-300, 1990.

Digital Library

Google Scholar

[8]

M. Chrobak and L.L. Larmore. An optimal online algorithm for k servers on trees. Submitted for publication, 1989.

Google Scholar

[9]

P.G. Doyle and J.L. Snell. Random Walks and Electric Networks. The Mathematical Association of America, 1984.

Crossref

Google Scholar

[10]

A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young. On competitive algorithms for paging problems. To appear in Journal of Algorithms, 1988.

Google Scholar

[11]

R. M. Foster. The average impedance of an electrical network. In Contributions to Applied Mechanics (Reissner Anniversary Volume), pages 333-340. Edwards Bros., Ann Arbor, Mich., 1949.

Google Scholar

[12]

R. M. Foster. An extension of a network theorem. IRE Trans. Circuit Theory, 8:75-76, 1961.

Crossref

Google Scholar

[13]

J.G. Kemeny, J. L. Snell, and A.W. Knapp. Denumerable Markov Chains. The University Series in Higher Mathematics. Van Nostrand, Princeton, NJ, 1966.

Google Scholar

[14]

M.S. Manasse, L.A. McGeoch, and D.D. Sleator. Competitive algorithms for on-line problems. In Twentieth ACM Annual Symposium on Theory of Computing, pages 322-333, 1988.

Digital Library

Google Scholar

[15]

A. W. Marshall and I. Olkin. Inequalities: Theory of Majorization and lts Applications. Academic Press, New York, 1979.

Google Scholar

[16]

C.H. Papadimitriou and M. Yanakakis. Shortest paths without a map. Proc. 16th ICALP, pages 610-620, July 1989.

Digital Library

Google Scholar

[17]

P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. In 16th International Colloquium on Automata, Languages, and Programming, volume 372 of Lecture Notes in Computer Science, pages 687-703. Springer- Verlag, July 1989. Revised version available as an IBM Research Report.

Digital Library

Google Scholar

[18]

D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, February 1985.

Digital Library

Google Scholar

[19]

L. Weinberg. Network Analysis and Synthesis. McGraw-Hill, New York, 1962.

Google Scholar

Cited By

View all

Sharma DThulasiraman KWu DJiang J(2019)A network science-based k-means++ clustering method for power systems network equivalenceComputational Social Networks10.1186/s40649-019-0064-36:1Online publication date: 22-Apr-2019
https://doi.org/10.1186/s40649-019-0064-3
Sharma DThulasiraman KWu DJiang J(2017)Power Network Equivalents: A Network Science Based K-Means Clustering Method Integrated with Silhouette AnalysisComplex Networks & Their Applications VI10.1007/978-3-319-72150-7_7(78-89)Online publication date: 27-Nov-2017
https://doi.org/10.1007/978-3-319-72150-7_7
Czyzowicz JPelc ALabourel A(2012)How to meet asynchronously (almost) everywhereACM Transactions on Algorithms10.1145/2344422.23444278:4(1-14)Online publication date: 4-Oct-2012
https://dl.acm.org/doi/10.1145/2344422.2344427
Show More Cited By

Index Terms

Random walks on weighted graphs, and applications to on-line algorithms
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Network flows
  2. Probability and statistics
    1. Probabilistic algorithms
    2. Probabilistic reasoning algorithms
      1. Markov-chain Monte Carlo methods
      2. Sequential Monte Carlo methods
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Network flows

Recommendations

Interlacings for Random Walks on Weighted Graphs and the Interchange Process

We study Aldous's conjecture that the spectral gap of the interchange process on a weighted undirected graph equals the spectral gap of the random walk on this graph. We present a conjecture in the form of an inequality and prove that this inequality ...
Multiple Random Walks in Random Regular Graphs

We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random $r$-regular ...
Short Random Walks on Graphs

The short-term behavior of random walks on graphs is studied, in particular, the rate at which a random walk discovers new vertices and edges. A conjecture by Linial that the expected time to find $\cal N$ distinct vertices is $O({\cal N}^{3})$ is ...

Comments

Information & Contributors

Information

Published In

STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of Computing

April 1990

574 pages

ISBN:0897913612

DOI:10.1145/100216

Editor:
Harriet Ortiz

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC90

Sponsor:

SIGACT

STOC90: 22nd Annual ACM Symposium on Theory of Computing

May 13 - 17, 1990

Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
524
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)4

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sharma DThulasiraman KWu DJiang J(2019)A network science-based k-means++ clustering method for power systems network equivalenceComputational Social Networks10.1186/s40649-019-0064-36:1Online publication date: 22-Apr-2019
https://doi.org/10.1186/s40649-019-0064-3
Sharma DThulasiraman KWu DJiang J(2017)Power Network Equivalents: A Network Science Based K-Means Clustering Method Integrated with Silhouette AnalysisComplex Networks & Their Applications VI10.1007/978-3-319-72150-7_7(78-89)Online publication date: 27-Nov-2017
https://doi.org/10.1007/978-3-319-72150-7_7
Czyzowicz JPelc ALabourel A(2012)How to meet asynchronously (almost) everywhereACM Transactions on Algorithms10.1145/2344422.23444278:4(1-14)Online publication date: 4-Oct-2012
https://dl.acm.org/doi/10.1145/2344422.2344427
Guilbault SPelc A(2011)Asynchronous rendezvous of anonymous agents in arbitrary graphsProceedings of the 15th international conference on Principles of Distributed Systems10.1007/978-3-642-25873-2_29(421-434)Online publication date: 13-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25873-2_29
Cinkir Z(2011)Generalized Foster's identitiesInternational Journal of Quantum Chemistry10.1002/qua.22521111:10(2228-2233)Online publication date: 21-Apr-2011
https://doi.org/10.1002/qua.22521
Czyzowicz JLabourel APelc ACharikar M(2010)How to meet asynchronously (almost) everywhereProceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms10.5555/1873601.1873604(22-30)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.5555/1873601.1873604
Fraigniaud PPelc A(2008)Deterministic Rendezvous in Trees with Little MemoryProceedings of the 22nd international symposium on Distributed Computing10.1007/978-3-540-87779-0_17(242-256)Online publication date: 22-Sep-2008
https://dl.acm.org/doi/10.1007/978-3-540-87779-0_17
Dessmark AFraigniaud PKowalski DPelc A(2006)Deterministic Rendezvous in GraphsAlgorithmica10.5555/3118736.311883546:1(69-96)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.5555/3118736.3118835
De Marco GGargano LKranakis EKrizanc DPelc AVaccaro U(2006)Asynchronous deterministic rendezvous in graphsTheoretical Computer Science10.1016/j.tcs.2005.12.016355:3(315-326)Online publication date: 14-Apr-2006
https://dl.acm.org/doi/10.1016/j.tcs.2005.12.016
Kowalski DMalinowski A(2006)How to meet in anonymous networkProceedings of the 13th international conference on Structural Information and Communication Complexity10.1007/11780823_5(44-58)Online publication date: 2-Jul-2006
https://dl.acm.org/doi/10.1007/11780823_5
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Interlacings for Random Walks on Weighted Graphs and the Interchange Process

Multiple Random Walks in Random Regular Graphs

Short Random Walks on Graphs

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Interlacings for Random Walks on Weighted Graphs and the Interchange Process

Multiple Random Walks in Random Regular Graphs

Short Random Walks on Graphs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations