The DOI matches its Crossref record.
Random Walks and Electric Networks
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
Doyle & Snell (1984) demonstrated that resistance distances from circuit theory are directly proportional to the movements of Markovian random walkers on graphs.
“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 Doyle & Snell (1984)
Section 1.3.1 connects random walks on graphs with resistor networks and reversible Markov chains, and §1.3.4 relates effective resistance to a walker's probability of reaching one vertex before returning to another. But §1.3.4 gives that probability as proportional to effective conductance—the reciprocal of resistance—not as directly proportional to resistance. The claimed direct proportionality to the walker's “movements” is therefore not established. (LLM, conf=0.86)
Experimental — accuracy not yet measuredCircuit theory simultaneously considers all possible pathways connecting population pairs, producing a map where current density varies across pixels and is analogous to the probability of use by random walkers.
“Circuit theory simultaneously considers all possible pathways connecting population pairs, producing a map where current density varies across pixels and is analogous to the probability of use by random walkers (Doyle & Snell 1984).”
From Landscape connectivity for wildlife: development and validation of multispecies linkage maps (2014) · cites this paper as Doyle & Snell 1984
Section 1.3.2 models currents across a network between two points, and §1.3.3 relates current on each edge to random walks between those points. But §1.3.3 defines current as the expected net number of edge crossings, not the probability that a walker uses an edge. The copy does not describe population pairs, pixel maps, or current density across pixels; no page numbers are available in the supplied passages. (LLM, conf=0.86)
Experimental — accuracy not yet measured
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
No references could be resolved yet.
Research works printed but not linked: 14
- M. L. Glasser and I. J. Zucker. Extended Watson integrals for the cubic lattice. Proc. Natl. Acad. Sci., USA, 74:1800-1801, 1977.
- R. Hersh and R. J. Griego. Brownian motion and potential theory. Scientific American, pages 66-74, March 1969.
- J. Jeans. The Mathematical Theory of Electricity and Magnetism, 5th Edition. 1966.
- S. Kakutani. Markov processes and the Dirichlet problem. Proc. Jap. Acad., 21:227-233, 1945.
- J. G. Kemeny, J. L. Snell, and G. L. Thompson. Finite Markov Chains, 3rd Edition. 1974.
- A. Lehman. A resistor network inequality, Problem 60-5. SIAM Review, 4:150-154, 1965.
- J. C. Maxwell. Treatise on Electricity and Magnetism, 3rd Edition. 1891.
- W. H. McCrea and F. J. W. Whipple. Random paths in two and three dimensions. Proc. of the Royal Soc. of Edinburgh, 60:281- 298, 1940.
- E. W. Montroll and B. J. West. Fluctuation phenomena. In Studies in Statistical Mathematics, volume 7, pages 61-175. 1979.
- C. St. J. A. Nash-Williams. Random walk and electric currents in networks. Proc. Camb. Phil. Soc., 55:181-194, 1959.
- G. Polya. How to Solve It, 2nd Edition. 1957.
- J. W. S. Rayleigh. On the theory of resonance. In Collected sci- entific papers, volume 1, pages 33-75. 1899.
- H. L. Royden. Harmonic functions on open Riemann surfaces. Trans. Amer. Math. Soc., 73:40-94, 1952.
- G. N. Watson. Three triple integrals. Quarterly J. Math., 10:266- 276, 1939.
Cited by
Sorted by citations
Random Walks for Image Segmentation
Grady, L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.233 · Cited by 2,624
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
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
McRae, B. H. (2006) · Evolution · doi:10.1111/j.0014-3820.2006.tb00500.x · Cited by 1,081
Circuit‐theory applications to connectivity science and conservation
Dickson, B. G., Albano, C. M., Anantharaman, R., Beier, P., Fargione, J., Graves, T. A., Gray, M. E., Hall, K. R., Lawler, J. J., Leonard, P. B., et al. (2019) · Conservation Biology · doi:10.1111/cobi.13230 · Cited by 461
Methods for the integration of multi-omics data: mathematical aspects
Bersanelli, M., Mosca, E., Remondini, D., Giampieri, E., Sala, C., Castellani, G., & Milanesi, L. (2016) · BMC Bioinformatics · doi:10.1186/s12859-015-0857-9 · Cited by 449
The electrical resistance of a graph captures its commute and cover times
Chandra, A. K., Raghavan, P., Ruzzo, W. L., Smolensky, R., & Tiwari, P. (1996) · Computational Complexity · doi:10.1007/bf01270385 · Cited by 328
Random Walks: A Review of Algorithms and Applications
Xia, F., Liu, J., Nie, H., Fu, Y., Wan, L., & Kong, X. (2020) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2019.2952908 · Cited by 295
Landscape connectivity for wildlife: development and validation of multispecies linkage maps
Koen, E. L., Bowman, J., Sadowski, C., & Walpole, A. A. (2014) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.12197 · Cited by 293
Recovery of consciousness is mediated by a network of discrete metastable activity states
Hudson, A. E., Calderon, D. P., Pfaff, D. W., & Proekt, A. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1408296111 · Cited by 178
Topological data analysis of contagion maps for examining spreading processes on networks
Taylor, D., Klimm, F., Harrington, H. A., Kramár, M., Mischaikow, K., Porter, M. A., & Mucha, P. J. (2015) · Nature Communications · doi:10.1038/ncomms8723 · Cited by 148
Comparison of methods for estimating omnidirectional landscape connectivity
Phillips, P., Clark, M. M., Baral, S., Koen, E. L., & Bowman, J. (2021) · Landscape Ecology · doi:10.1007/s10980-021-01254-2 · Cited by 62
Random Walks on Regular and Irregular Graphs
Coppersmith, D., Feige, U., & Shearer, J. (1996) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480193260595 · Cited by 49
Unifying Constraints Linking Protein Folding and Native Dynamics Decoded from AlphaFold
Zhang, Z., Ren, W., Xie, L., Zheng, Y., Guan, X., Wang, J., Li, W., & Tang, Q.-Y. (2026) · Physical Review Letters · doi:10.1103/7j2j-f8f7 · Cited by 5
Unifying constraints linking protein folding and native dynamics decoded from AlphaFold
Zhang, Z., Ren, W., Xie, L., Zheng, Y., Guan, X., Wang, J., Li, W., & Tang, Q.-Y. (2026) · doi:10.64898/2026.01.08.698426 · Cited by 5
Metadata
- Authors
- Doyle, P., & Snell, J.
- Venue
- Carus Mathematical Monographs
- Publisher
- American Mathematical Society
- Published
- 1984
- ISSN
- 0069-0813
- 2637-7535
- Cited by
- 1,061
- References
- 0
- Language
- en
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