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 101–200 of 316
Convergence of metric graphs and energy forms
Kasue, A. (2010) · Revista Matemática Iberoamericana · doi:10.4171/rmi/605 · Cited by 21
Oversquashing in GNNs through the lens of information contraction and graph expansion
Banerjee, P. K., Karhadkar, K., Wang, Y. G., Alon, U. S., & Montúfar, G. (2022) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton49937.2022.9929363 · Cited by 32
Identifying influential nodes based on resistance distance
Li, M., Zhou, S., Wang, D., & Chen, G. (2023) · Journal of Computational Science · doi:10.1016/j.jocs.2023.101972 · Cited by 20
Hitting and trapping times on branched structures
Agliari, E., Sartori, F., Cattivelli, L., & Cassi, D. (2015) · Physical Review E · doi:10.1103/physreve.91.052132 · Cited by 21
Applications of Laplacian spectra for extended Koch networks
Hou, B., Zhang, H. J., & Liu, L. (2012) · The European Physical Journal B · doi:10.1140/epjb/e2012-30373-x · Cited by 20
Distributed Estimation From Relative and Absolute Measurements
Rossi, W. S., Frasca, P., & Fagnani, F. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2661400 · Cited by 25
Further results on the expected hitting time, the cover cost and the related invariants of graphs
Huang, J., Li, S., & Xie, Z. (2018) · Discrete Mathematics · doi:10.1016/j.disc.2018.09.019 · Cited by 20
COOPERATIVE LEARNING IN MULTI-AGENT SYSTEMS FROM INTERMITTENT MEASUREMENTS∗Preprint
Leonard, N. E., Leonard, & Olshevsky, A. (2016) · Cited by 20
Cowley, D. J., Johnson, O., & Pocock, M. J. O. (2015) · Landscape Ecology · doi:10.1007/s10980-015-0168-6 · Cited by 23
Randomly biased walks on subcritical trees
Arous, G. B., & Hammond, A. (2012) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21416 · Cited by 19
The entire mean weighted first-passage time on a family of weighted treelike networks
Dai, M., Sun, Y., Sun, Y. K., Xi, L., & Shao, S. (2016) · Scientific Reports · doi:10.1038/srep28733 · Cited by 18
Overlapping Community Detection by Kernel-Based Fuzzy Affinity Propagation
Ding, F., Luo, Z., Shi, J., & Fang, X. (2010) · International Workshop on Intelligent Systems and Applications (ISA) · doi:10.1109/iwisa.2010.5473438 · Cited by 20
Ito, T., & Jeffery, S. (2018) · Algorithmica · doi:10.1007/s00453-018-0527-1 · Cited by 39
A planktonic diatom displays genetic structure over small spatial scales
Sefbom, J., Kremp, A., Rengefors, K., Jonsson, P. R., Sjöqvist, C., & Godhe, A. (2018) · Environmental Microbiology · doi:10.1111/1462-2920.14117 · Cited by 20
On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain
Huang, S., & Li, S. (2020) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124999 · Cited by 18
Li, S., Sun, W., & Wang, S. (2019) · International Journal of Quantum Chemistry · doi:10.1002/qua.25969 · Cited by 18
The Laplacian Spectrum of Large Graphs Sampled From Graphons
Vizuete, R., Garin, F., & Frasca, P. (2021) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2021.3069675 · Cited by 31
Fast link prediction for large networks using spectral embedding
Pachev, B., & Webb, B. (2017) · Journal of Complex Networks · doi:10.1093/comnet/cnx021 · Cited by 19
Decentralized Consensus Optimization and Resource Allocation
Nedić, A., Olshevsky, A., & Shi, W. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97478-1_10 · Cited by 19
Two-point resistances and random walks on stellated regular graphs
Yang, Y., & Klein, D. J. (2018) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aaf8e7 · Cited by 17
Return Probability and Recurrence for the Random Walk Driven by Two-Dimensional Gaussian Free Field
Biskup, M., Ding, J., & Goswami, S. (2019) · Communications in Mathematical Physics · doi:10.1007/s00220-019-03589-z · Cited by 22
On electric resistances for distance-regular graphs
Koolen, J. H., Markowsky, G., & Park, J. (2012) · European Journal of Combinatorics · doi:10.1016/j.ejc.2012.12.001 · Cited by 17
On the inverse mean first passage matrix problem and the inverse M-matrix problem
Neumann, M., & Sze, N.-S. (2010) · Linear Algebra and its Applications · doi:10.1016/j.laa.2010.02.019 · Cited by 16
Nearby large islands diminish biodiversity of the focal island by a negative target effect
Wang, D., Zhao, Y., Tang, S., Liu, X., Li, W., Han, P., Zeng, D., Yang, Y., Wei, G., Kang, Y., et al. (2022) · Journal of Animal Ecology · doi:10.1111/1365-2656.13856 · Cited by 16
The Cover Time of Deterministic Random Walks
Friedrich, T., & Sauerwald, T. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14031-0_16 · Cited by 16
How to Compute Times of Random Walks Based Distributed Algorithms
Bui, A., & Sohier, D. (2007) · Fundamenta Informaticae · doi:10.3233/fun-2007-80402 · Cited by 17
Integer-only cross field computation
Farchi, N., & Ben‐Chen, M. (2018) · ACM Transactions on Graphics · doi:10.1145/3197517.3201375 · Cited by 16
Scaling up network centrality computations – A brief overview
van der Grinten, A., Angriman, E., & Meyerhenke, H. (2020) · it - Information Technology · doi:10.1515/itit-2019-0032 · Cited by 16
Genomics and ecological modelling clarify species integrity in a confusing group of butterflies
Campbell, E. O., MacDonald, Z. G., Gage, E., Gage, R. V., & Sperling, F. A. H. (2022) · Molecular Ecology · doi:10.1111/mec.16407 · Cited by 16
Expected hitting times for random walks on quadrilateral graphs and their applications
Huang, J., & Li, S. (2017) · Linear and Multilinear Algebra · doi:10.1080/03081087.2017.1395793 · Cited by 16
Random walks on a tree with applications
Ma, F., & Wang, P. (2020) · Physical review. E · doi:10.1103/physreve.102.022305 · Cited by 20
Coherence analysis of a class of weighted tree-like polymer networks
He, J., Dai, M., Zong, Y., Zou, J., Sun, Y. K., & Su, W. (2018) · Modern Physics Letters B · doi:10.1142/s0217984918500641 · Cited by 15
Statistical Analysis of Networks
Avrachenkov, K. E., & Dreveton, M. (2022) · Emerald Group Publishing Limited eBooks · doi:10.1561/9781638280514 · Cited by 26
Scaling Limit for the Ant in High‐Dimensional Labyrinths
Arous, G. B., Cabezas, M., & Fribergh, A. (2019) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21813 · Cited by 15
Effective Resistance of Finite Two-Dimensional Grids Based on Infinity Mirror Technique
Bairamkulov, R., & Friedman, E. G. (2020) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2020.2985652 · Cited by 15
Design of On-Line Algorithms Using Hitting Times
Tetali, P. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539798335511 · Cited by 15
Stable limit laws for randomly biased walks on supercritical trees
Hammond, A. (2013) · The Annals of Probability · doi:10.1214/12-aop752 · Cited by 15
Extending isolation by resistance to predict genetic connectivity
Fletcher, R. J., Sefair, J. A., Kortessis, N., Jaffé, R., Holt, R. D., Robertson, E. P., Duncan, S. I., Marx, A. J., & Austin, J. D. (2022) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.13975 · Cited by 17
The Evolution of the Cover Time
Barlow, M. T., Ding, J., Nachmias, A., & Peres, Y. (2011) · Combinatorics Probability Computing · doi:10.1017/s0963548310000489 · Cited by 50
Laplacian Spectra for Categorical Product Networks and Its Applications
Kang, S. M., Siddiqui, M. K., Rehman, N. A., Imran, M., & Muhammad, M. H. (2018) · Symmetry · doi:10.3390/sym10060206 · Cited by 14
Determining entire mean first-passage time for Cayley networks
Wang, X., Dai, M., Chen, Y., Zong, Y., Sun, Y. K., & Su, W. (2018) · International Journal of Modern Physics C · doi:10.1142/s0129183118500092 · Cited by 13
Mixing time of near-critical random graphs
Ding, J., Lubetzky, E., & Peres, Y. (2012) · The Annals of Probability · doi:10.1214/11-aop647 · Cited by 20
Bringing circuit theory into spatial occupancy models to assess landscape connectivity
Kervellec, M., Couturier, T., Bauduin, S., Chenesseau, D., du Rau, P. D., Drouet‐Hoguet, N., Duchamp, C., Steinmetz, J., Vandel, J., & Giménez, O. (2024) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.14418 · Cited by 14
Oscillatory localization of quantum walks analyzed by classical electric circuits
Ambainis, A., Prūsis, K., Vihrovs, J., & Wong, T. G. (2016) · Physical Review A · doi:10.1103/physreva.94.062324 · Cited by 13
Blanchard, P., DAWIN, J. R., & Volchenkov, D. (2010) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2010-01232-1 · Cited by 14
Dynamical properties of model gene networks and implications for the inverse problem
Perkins, T. J., Hallett, M., & Glass, L. (2005) · Biosystems · doi:10.1016/j.biosystems.2005.09.010 · Cited by 12
Deterministic approximation of the cover time
Feige, U., & Rabinovich, Y. G. (2003) · Random Structures and Algorithms · doi:10.1002/rsa.10083 · Cited by 13
Infectious Random WalksPreprint
Pettarin, A., Pietracaprina, A., Pucci, G., & Upfal, E. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1007.1604 · Cited by 12
A new method to automatically compute processing times for random walks based distributed algorithms
Bernard, T., Bui, A., Bui, M., & Sohier, D. (2004) · International Symposium on Parallel and Distributed Computing · doi:10.1109/ispdc.2003.1267640 · Cited by 12
Haran, J., Rossi, J., Pajares, J. A., Bonifácio, L., Naves, P., Alain Roques, B., & Roux, G. (2017) · PeerJ · doi:10.7717/peerj.4135 · Cited by 13
Spectral analysis and consensus problems for a class of fractal network models
Zhang, Z., & Wu, B. (2020) · Physica Scripta · doi:10.1088/1402-4896/ab9e96 · Cited by 11
Kemeny’s constant for a graph with bridges
Breen, J., Crisostomi, E., & Kim, S. (2022) · Discrete Applied Mathematics · doi:10.1016/j.dam.2022.08.004 · Cited by 17
Spectral analysis for a family of treelike networks
Dai, M., Wang, X., Chen, Y., Zong, Y., Sun, Y. K., & Su, W. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.02.088 · Cited by 11
Hitting Times for Random Walks on Sierpiński Graphs and Hierarchical Graphs
Qi, Y., Dong, Y., Zhang, Z., & Zhang, Z. (2019) · The Computer Journal · doi:10.1093/comjnl/bxz080 · Cited by 12
Chen, S., Seveno, D., & Gorbatikh, L. (2021) · Composites Part A Applied Science and Manufacturing · doi:10.1016/j.compositesa.2021.106632 · Cited by 11
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata
Beame, P. W., Borodin, A., Raghavan, P., Ruzzo, W. L., & Tompa, M. (1996) · Information and Computation · doi:10.1006/inco.1996.0085 · Cited by 11
Self-citationCover Time and Broadcast TimePreprint
Elsässer⋆, R., & Sauerwald, T. (2009) · arXiv (Cornell University) · doi:10.4230/lipics.stacs.2009.1842 · Cited by 11
On the properties of Laplacian pseudoinverses
Fontan, A., & Altafini, C. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683525 · Cited by 15
Cooperative Learning in Multiagent Systems from Intermittent Measurements
Leonard, N. E., & Olshevsky, A. (2013) · SIAM Journal on Control and Optimization · doi:10.1109/cdc.2013.6761079 · Cited by 10
Expected hitting times for random walks on the k-triangle graph and their applications
Wang, C., Guo, Z., & Li, S. (2018) · Applied Mathematics and Computation · doi:10.1016/j.amc.2018.06.056 · Cited by 10
Applications of the Adversary Method in Quantum Query AlgorithmsPreprint
Belovs, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.3858 · Cited by 21
Expansion and the cover time of parallel random walks
Sauerwald, T. (2010) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1835698.1835776 · Cited by 9
Network Design for s-t Effective Resistance
Chan, P.-H., Lau, L., Schild, A., Wong, S. C.-W., & Zhou, H. (2019) · ACM Trans. Algorithms · doi:10.1145/3522588 · Cited by 9
The Hitting Times of Random Walks on Bicyclic Graphs
Zhu, X., & Zhang, X. (2021) · Graphs and Combinatorics · doi:10.1007/s00373-021-02360-3 · Cited by 9
Kirchhoff index of Vicsek polygon networks and its applications
Wu, Z., Xue, Y., He, H., Zeng, C., & Wang, W. (2024) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2024.115022 · Cited by 9
Trapping efficiency of random walks on weighted scale-free trees
Gao, L., Peng, J., Tang, C., & Riascos, A. P. (2021) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/ac02cb · Cited by 9
Expanded Koch networks: structure and trapping time of random walks
Hou, B., Zhang, H., & Liu, L. (2013) · The European Physical Journal B · doi:10.1140/epjb/e2013-30905-x · Cited by 9
Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
Sylvester, J. (2020) · Journal of Graph Theory · doi:10.1002/jgt.22551 · Cited by 20
Randomly Distributed Tasks in Bounded Time
Bui, A., Bui, M., & Sohier, D. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39884-4_4 · Cited by 9
The Cover Time of Random Walks on GraphsPreprint
Abdullah, M. A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.5569 · Cited by 13
Structural Properties on Scale-Free Tree Network with an Ultra-Large Diameter
Ma, F., & Wang, P. (2024) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3674146 · Cited by 12
Effective resistances for supercritical percolation clusters in boxes
Abe, Y. (2015) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/14-aihp604 · Cited by 14
Random walks on graphs and Monte Carlo methods
Cheng, W.-J., Cox, J., & Whitlock, P. A. (2015) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2015.12.006 · Cited by 8
Speeding Up Cover Time of Sparse Graphs Using Local Knowledge
Abdullah, M. A., Cooper, C., & Draief, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29516-9_1 · Cited by 14
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
Apers, S., & de Wolf, R. (2022) · SIAM Journal on Computing · doi:10.1137/21m1391018 · Cited by 40
Kron Reduction and Effective Resistance of Directed Graphs
Sugiyama, T., & Sato, K. (2023) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/22m1480823 · Cited by 8
Numerical evidence against a conjecture on the cover time of planar graphs
Mendonça, J. R. G. (2011) · Physical Review E · doi:10.1103/physreve.84.022103 · Cited by 8
A Token-Based Approach for Distributed Computation in Sensor Networks
Saligrama, V., & Alanyali, M. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2125776 · Cited by 8
The Simple Random Walk on a Random Voronoi Tiling
Sarkar, A., & Addario‐Berry, L. (2005) · Cited by 8
Geometric bounds on the fastest mixing Markov chain
Olesker-Taylor, S., & Zanetti, L. (2024) · Probability Theory and Related Fields · doi:10.1007/s00440-023-01257-x · Cited by 8
Koolen, J. H., & Markowsky, G. (2015) · Discrete Mathematics · doi:10.1016/j.disc.2015.10.012 · Cited by 8
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network AnalysisPreprint
Angriman, E., Predari, M., van der Grinten, A., & Meyerhenke, H. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.esa.2020.6 · Cited by 8
The local limit of uniform spanning trees
Nachmias, A., & Peres, Y. (2021) · Probability Theory and Related Fields · doi:10.1007/s00440-021-01072-2 · Cited by 7
Multidimensional Quantum Walks
Jeffery, S., & Zur, S. (2023) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3564246.3585158 · Cited by 24
Cover times for sequences of reversible Markov chains on random graphs
Abe, Y. (2014) · Kyoto journal of mathematics · doi:10.1215/21562261-2693442 · Cited by 7
Orienteering in Knowledge Spaces: The Hyperbolic Geometry of Wikipedia Mathematics
Leibon, G., & Rockmore, D. N. (2013) · PLoS ONE · doi:10.1371/journal.pone.0067508 · Cited by 7
Detecting dynamic communities in opportunistic networks
Xu, K., Yang, G., Li, V. O. K., & Chan, S.-Y. (2009) · International Conference on Ubiquitous and Future Networks · doi:10.1109/icufn.2009.5174304 · Cited by 7
Numerical investigation of metrics for epidemic processes on graphs
Goering, M., Albin, N., Poggi‐Corradini, P., Scoglio, C., & Sahneh, F. D. (2015) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2015.7421356 · Cited by 10
Effective Resistance Preserving Directed Graph Symmetrization
Fitch, K. (2019) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/18m1172892 · Cited by 11
Uribe, C. A., Olshevsky, A., & Nedić, A. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3140698 · Cited by 8
Spectra, Hitting Times and Resistance Distances ofq- Subdivision Graphs
Zeng, Y., & Zhang, Z. (2019) · The Computer Journal · doi:10.1093/comjnl/bxz141 · Cited by 7
Randomized Gossiping With Effective Resistance Weights: Performance Guarantees and Applications
Can, B., Soori, S., Aybat, N. S., Dehnavi, M. M., & Gürbüzbalaban, M. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3161201 · Cited by 10
Hitting times computation for theoretically studying peer-to-peer distributed systems
Sohier, D., & Bui, A. (2004) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2004.1303187 · Cited by 7
Quantum algorithms for approximating the effective resistances of electrical networks.Preprint
Wang, G. (2013) · arXiv (Cornell University) · Cited by 8
Electric network for non-reversible Markov chainsPreprint
(2014) · Cited by 7
Mathematical Analysis of Resistance distance with Kirchhoff Index in Chain Octahedron Structure
Sajjad, W. (2025) · Circuits Systems and Signal Processing · doi:10.1007/s00034-025-03060-6 · Cited by 6
Maass, A. I., Nešić, D., Postoyan, R., Varma, V. S., Lasaulce, S., & Muñoz‐Carpintero, D. (2024) · Automatica · doi:10.1016/j.automatica.2024.111936 · Cited by 6
ASYMPTOTIC BEHAVIOR OF RESISTANCE DISTANCES IN CAYLEY GRAPHS
Vaskouski, M. M., & Zadorozhnyuk, A. O. (2018) · Doklady of the National Academy of Sciences of Belarus · doi:10.29235/1561-8323-2018-62-2-140-146 · Cited by 6
Robust and Sample Optimal Algorithms for PSD Low Rank Approximation
Bakshi, A., Chepurko, N., & Woodruff, D. P. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00054 · Cited by 26
Iwama, K., & Yoshida, Y. (2017) · ACM Transactions on Computation Theory · doi:10.1145/3155294 · Cited by 6
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.