The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
The electrical resistance of a graph captures its commute and cover times
Abstract
View an n-vertex, m-edge undirected graph as an electrical network with unit resistors as edges. We extend known relations between random walks and electrical networks by showing that resistance in this network is intimately connected with the lengths of random walks on the graph. For example, the commute time between two vertices s and t (the expected length of a random walk from s to t and back) is precisely characterized by the effective resistance Rst between s and t: commute time = 2mRst. Additionally, the cover time (the expected length of a random walk visiting all vertices) is characterized by the maximum resistance R in the graph to within a factor of log n: mR ≤ cover time ≤ O (mR log n). For many graphs, the bounds on cover time obtained in this manner are better than those obtained from previous techniques such as the eigenvalues of the adjacency matrix. In particular, using this approach, we improve known bounds on cover times for various classes of graphs, including high-degree graphs, expanders, and multi-dimensional meshes. Moreover, resistance seems to provide an intuitively appealing and tractable approach to these problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A treatise on electricity and magnetism
(1954) · Journal of the Franklin Institute · doi:10.1016/0016-0032(54)90053-8 · Cited by 9,077
Franklin, J. (1968) · Cited by 1,807
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Jerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 768
A random polynomial-time algorithm for approximating the volume of convex bodies
Dyer, M., Frieze, A., & Kannan, R. (1991) · Journal of the ACM · doi:10.1145/102782.102783 · Cited by 693
Random walks, universal traversal sequences, and the complexity of maze problems
Aleliunas, R., Karp, R. M., Lipton, R. J., Lovasz, L., & Rackoff, C. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.34 · Cited by 692
Treatise on Natural Philosophy
Thomson, W., Baron, K., & Tait, P. G. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511703928 · Cited by 451
Göbel, F., & Jagers, A. A. (1974) · Stochastic Processes and their Applications · doi:10.1016/0304-4149(74)90001-5 · Cited by 246
Coalescing Random Walks and Voter Model Consensus Times on the Torus in $\mathbb{Z}^d$
Cox, J. T. (1989) · The Annals of Probability · doi:10.1214/aop/1176991158 · Cited by 219
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
Jerrum, M., & Sinclair, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62234 · Cited by 201
Expanding graphs contain all small trees
Friedman, J., & Pippenger, N. J. (1987) · COMBINATORICA · doi:10.1007/bf02579202 · Cited by 166
Two Applications of Inductive Counting for Complementation Problems
Borodin, A., Cook, S. A., Dymond, P. W., Ruzzo, W. L., & Tompa, M. (1989) · SIAM Journal on Computing · doi:10.1137/0218038 · Cited by 134
Self-citationBroder, A., & Karlin, A. R. (1989) · Journal of Theoretical Probability · doi:10.1007/bf01048273 · Cited by 113
On the cover time of random walks on graphs
Kahn, J., Linial, N., Nisan, N., & Saks, M. (1989) · Journal of Theoretical Probability · doi:10.1007/bf01048274 · Cited by 108
Covering Problems for Brownian Motion on Spheres
Matthews, P. (1988) · The Annals of Probability · doi:10.1214/aop/1176991894 · Cited by 104
Bounds for eigenvalues of certain stochastic matrices
Landau, H. J., & Odlyzko, A. M. (1981) · Linear Algebra and its Applications · doi:10.1016/0024-3795(81)90003-3 · Cited by 88
On the time taken by random walks on finite groups to visit every state
Aldous, D. (1983) · Probability Theory and Related Fields · doi:10.1007/bf00535260 · Cited by 83
Constructing disjoint paths on expander graphs
Peleg, D., & Upfal, E. (1989) · COMBINATORICA · doi:10.1007/bf02125897 · Cited by 50
The fundamental theorem of electrical networks
Synge, J. L. (1951) · Quarterly of Applied Mathematics · doi:10.1090/qam/42958 · Cited by 43
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Fouss, F., Pirotte, A., Renders, J.-M., & Saerens, M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.46 · Cited by 1,265
Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.897962 · Cited by 1,108
Minimizing Effective Resistance of a Graph
Ghosh, A., Boyd, S., & Saberi, A. (2008) · SIAM Review · doi:10.1137/050645452 · Cited by 443
Fast discovery of connection subgraphs
Faloutsos, C., McCurley, K. S., & Tomkins, A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014068 · Cited by 355
Metadata
- Authors
- Chandra, A. K., Raghavan, P., Ruzzo, W. L., & Smolensky, R.
- Venue
- Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89
- Publisher
- ACM Press
- Published
- 1989
- Pages
- 574-586
- OpenAlex
- W1972636593
- Cited by
- 360
- References
- 19
- FWCI
- 6.35
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.