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
Cited by
Items 301–316 of 316
Johnson, J. R., & Walters, M. (2024) · Mathematika · doi:10.1112/mtk.12278
Random walks on bifractal networks
Yakubo, K., Shimojo, G., & Yamamoto, J. (2024) · Physical review. E · doi:10.1103/physreve.110.064318
Socievole, A., & Pizzuti, C. (2025) · Lecture notes in social networks · doi:10.1007/978-3-031-85386-9_14
Vaskouski, M. M., Zadarazhniuk, H. A., & Hanimar, A. U. (2025) · Proceedings of the National Academy of Sciences of Belarus Physics and Mathematics Series · doi:10.29235/1561-2430-2025-61-2-106-117
Efficient community detection in disaster networks using spectral sparsification
Socievole, A., & Pizzuti, C. (2025) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2025.102106
Study of line defects in infinite networks of resistors
Németh, R., Cserti, J., & Széchenyi, G. (2025) · New Journal of Physics · doi:10.1088/1367-2630/ae1867
Fletcher, R. J., & Fortin, M. (2025) · Springer eBooks · doi:10.1007/978-3-032-02424-4_10
Complexité en espace de l'exploration de graphes
Ilcinkas, D., & FRAIGNIAUD, P. (2006) · OpenGrey (Institut de l'Information Scientifique et Technique)
Promoting Fairness in Information Access Within Social Networks
Liu, C., Zhou, X., Zehmakan, A. N., & Zhang, Z. (2026) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde65706.2026.00038
Socievole, A., & Pizzuti, C. (2026) · Soft Computing · doi:10.1007/s00500-025-10734-5
Hypernode graphs for learning from binary relations between sets of objects
Ricatte, T. (2015) · theses.fr (ABES) · doi:10.70675/41ec01ebz2076z48adzb8ffzd32c8cd8403e
(2022) · Emerald Group Publishing Limited eBooks · doi:10.1561/978-1-63828-051-420251011
Topology-Aware Vulnerability Prioritization on Automated Attack Graphs from Infrastructure-as-Code
Tiță, I., Corățu, L.-I., Cujbă, M.-C., & Țăpuș, N. (2026) · Future Internet · doi:10.3390/fi18060283 · Cited by 1
Computation of the Resistance Distance Metric in Two Classes of DNA Network
Yang, J., & Sajjad, W. (2026) · Combinatorial Chemistry & High Throughput Screening · doi:10.2174/0113862073464407260602063050
Volchenkov, D. (2026) · Dynamics · doi:10.3390/dynamics6030034
Matrix Criteria for Exact Equipotential Merging of Internal Nodes in Linear Circuits
Михайленко, М. В. (2025) · Radioelectronics and Communications Systems · doi:10.3103/s0735272725060044
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.