The electrical resistance of a graph captures its commute and cover times
The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Specifically, Doyle & Snell (1984) demonstrated that resistance distances from circuit theory are directly proportional to the movements of Markovian random walkers on graphs, and Chandra et al. (1996) related resistance distances to “commute times,” or the time it takes a random walker to travel from one point to another and back again.”
From Circuit‐theory applications to connectivity science and conservation (2019) · cites this paper as Chandra et al. (1996)
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
Introduction to Probability Models.
Jolliffe, F., & Ross, S. M. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983433 · Cited by 4,525
Franklin, J. (1968) · Cited by 1,807
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Random Walks and Electric Networks
Doyle, P., & Snell, J. (1984) · Carus Mathematical Monographs · doi:10.5948/upo9781614440222 · Cited by 1,061
Reversible Markov Chains and Random Walks on Graphs
Aldous, D., & Fill, J. A. (2014) · Cited by 973
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
The electrical resistance of a graph captures its commute and cover times
Chandra, A. K., Raghavan, P., Ruzzo, W. L., & Smolensky, R. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73062 · Cited by 360
Self-citationRandom walks and the effective resistance of networks
Tetali, P. (1991) · Journal of Theoretical Probability · doi:10.1007/bf01046996 · Cited by 310
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
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
Covering Problems for Brownian Motion on Spheres
Matthews, P. (1988) · The Annals of Probability · doi:10.1214/aop/1176991894 · Cited by 111
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
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
A Technique for Lower Bounding the Cover Time
Zuckerman, D. (1992) · SIAM Journal on Discrete Mathematics · doi:10.1137/0405007 · Cited by 42
Trading Space for Time in Undirected s - t Connectivity
Broder, A., Karlin, A. R., Raghavan, P., & Upfal, E. (1994) · SIAM Journal on Computing · doi:10.1137/s0097539790190144 · Cited by 35
Self-citationBarnes, G., & Feige, U. (1996) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480194264988 · Cited by 29
Lower bounds on the length of universal traversal sequences
Borodin, A., Ruzzo, W. L., & Tompat, M. (1992) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(92)90046-l · Cited by 27
Self-citationOn the time to traverse all edges of a graph
Zuckerman, D. (1991) · Information Processing Letters · doi:10.1016/0020-0190(91)90091-u · Cited by 13
A randomized time-space tradeoff of O˜(mRˆ) for USTCON
Feige, U. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366863 · Cited by 11
The cover time of a regular expander is O(n log n)
Rubinfeld, R. (1990) · Information Processing Letters · doi:10.1016/0020-0190(90)90173-u · Cited by 7
Cited by
USING CIRCUIT THEORY TO MODEL CONNECTIVITY IN ECOLOGY, EVOLUTION, AND CONSERVATION
McRae, B. H., Dickson, B. G., Keitt, T. H., & Shah, V. B. (2008) · Ecology · doi:10.1890/07-1861.1 · Cited by 2,244
McRae, B. H. (2006) · Evolution · doi:10.1111/j.0014-3820.2006.tb00500.x · Cited by 1,081
“Chandra et al. (1997) showed that commute times on weighted graphs are precisely related to effective resistances in analogous circuits when conductances are proportional to movement probabilities.”
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069
“Let us collect all the relations/arrows at hand [cf. Lemmata 5, 6, 7, and 9]: To apply the small gain theorem (Theorem 3) to get that q λ F is bounded, we need γ 1 γ 2 γ 3 γ 4 < 1, that is, (37) where β > 0 and η > 0 , along with other restrictions on parameters that appear in Lemmata 6, 7, and 9:…”
BackgroundMethodInfluentialReversible Markov Chains and Random Walks on Graphs
Aldous, D., & Fill, J. A. (2014) · Cited by 973
McRae, B. H. (2006) · Evolution · doi:10.1554/05-321.1 · Cited by 900
Metadata
- Authors
- Chandra, A. K., Raghavan, P., Ruzzo, W. L., Smolensky, R., & Tiwari, P.
- Affiliations
- IBM Research - Almaden (US)
- University of Washington (US)
- IBM (United States) (US)
- Corresponding author
- Chandra, Ashok K.
- Raghavan, Prabhakar
- Ruzzo, Walter L.
- Tiwari, Prasoon
- Venue
- Computational Complexity
- Published
- 1996-12
- Volume
- 6
- Issue
- 4
- Pages
- 312-340
- ISSN
- 1016-3328 (ISSN-L)
- 1420-8954
- OpenAlex
- W2048572907
- Cited by
- 328
- References
- 30
- Citations by year
- 2026: 8 · 2025: 9 · 2024: 15 · 2023: 17 · 2022: 27 · 2021: 21 · 2020: 19 · 2019: 20 · 2018: 24 · 2017: 25 · 2016: 10 · 2015: 16 · 2014: 16 · 2013: 18 · 2012: 15
- FWCI
- 1.54
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Computational Complexity (publishedVersion)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
- Keywords
- graph resistance, effective resistance, commuting time, cover time, random walks, electrical networks, expander graphs
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.