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
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
R Package gdistance : Distances and Routes on Geographical Grids
van Etten, J. (2017) · Journal of Statistical Software · doi:10.18637/jss.v076.i13 · Cited by 439
Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
Graph Sparsification by Effective Resistances
Spielman, D. A., & Srivastava, N. (2011) · SIAM Journal on Computing · doi:10.1137/080734029 · Cited by 489
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
“…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…”
BackgroundEllens, W., Spieksma, F. M., Mieghem, P. V., Jamakovic, A., & Kooij, R. E. (2011) · Linear Algebra and its Applications · doi:10.1016/j.laa.2011.02.024 · Cited by 273
Biological corridors and connectivity
Cushman, S. A., McRae, B., Adriaensen, F., Beier, P., Shirley, M., & Zeller, K. (2013) · Key Topics in Conservation Biology 2 · doi:10.1002/9781118520178.ch21 · Cited by 179
Van Dam, E. R., Koolen, J. H., & Tanaka, H. (2016) · The Electronic Journal of Combinatorics · doi:10.37236/4925 · Cited by 179
Circuitscape: A Tool for Landscape Ecology
Shah, V. B., & McRae, B. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/ewdj4033 · Cited by 176
Chip-Firing and Rotor-Routing on Directed Graphs
Holroyd, A. E., Levine, L., Mészáros, K., Peres, Y., Propp, J. G., & Wilson, D. B. (2008) · Progress in probability · doi:10.1007/978-3-7643-8786-0_17 · Cited by 167
Synchronization and Transient Stability in Power Networks and Nonuniform Kuramoto Oscillators
Dörfler, F., & Bullo, F. (2010) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2010.5530690 · Cited by 156
Clark, A., Bushnell, L. G., & Poovendran, R. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2281473 · Cited by 148
SYNCHRONIZATION AND TRANSIENT STABILITY IN POWER NETWORKS AND NON-UNIFORM KURAMOTO OSCILLATORS ∗
Dörfler, F., & Bullo, F. (2013) · Cited by 126
On the universal structure of human lexical semantics
Youn, H., Sutton, L. D., Smith, E., Moore, C., Wilkins, J. F., Maddieson, I., Croft, W., & Bhattacharya, T. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1520752113 · Cited by 167
Fast and flexible estimation of effective migration surfaces
Marcus, J. H., Ha, W., Barber, R. F., & Novembre, J. (2021) · eLife · doi:10.7554/elife.61927 · Cited by 120
Consensus and Coherence in Fractal Networks
Patterson, S., & Bamieh, B. A. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2357552 · Cited by 113
The effect of cost surface parameterization on landscape resistance estimates
KOEN, E. L., BOWMAN, J., & WALPOLE, A. A. (2012) · Molecular Ecology Resources · doi:10.1111/j.1755-0998.2012.03123.x · Cited by 110
The Alexander-Orbach conjecture holds in high dimensions
Kozma, G., & Nachmias, A. (2009) · Inventiones mathematicae · doi:10.1007/s00222-009-0208-4 · Cited by 105
Quantum walk speedup of backtracking algorithms
Montanaro, A. (2018) · Theory of Computing · doi:10.4086/toc.2018.v014a015 · Cited by 154
Cover times, blanket times, and majorizing measures
Ding, J., Lee, J., & Peres, Y. (2012) · Annals of Mathematics · doi:10.4007/annals.2012.175.3.8 · Cited by 140
Critical random graphs: Diameter and mixing time
Nachmias, A., & Peres, Y. (2008) · The Annals of Probability · doi:10.1214/07-aop358 · Cited by 89
Fletcher, R. J., Sefair, J. A., Wang, C., Poli, C. L., Smith, T. A. H., Bruna, E. M., Holt, R. D., Barfield, M., Marx, A. J., & Acevedo, M. A. (2019) · Ecology Letters · doi:10.1111/ele.13333 · Cited by 96
Circuit Theory and Model-Based Inference for Landscape Connectivity
Hanks, E. M., & Hooten, M. B. (2012) · Journal of the American Statistical Association · doi:10.1080/01621459.2012.724647 · Cited by 97
R package gdistance: distances and routes on geographical grids (version 1.1-4)
van Etten, J. (2012) · Cited by 79
van Etten, J., & Hijmans, R. J. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012060 · Cited by 75
Developments in the theory of randomized shortest paths with a comparison of graph node distances
Kivimäki, I., Shimbo, M., & Saerens, M. (2014) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.09.016 · Cited by 75
Bishop‐Taylor, R., Tulbure, M. G., & Broich, M. (2015) · Landscape Ecology · doi:10.1007/s10980-015-0230-4 · Cited by 80
Wagner, I. A., Lindenbaum, M., & Bruckstein, A. M. (2000) · The International Journal of Robotics Research · doi:10.1177/02783640022066716 · Cited by 71
Tight bounds for the cover time of multiple random walks
Elsässer⋆, R., & Sauerwald, T. (2010) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.08.010 · Cited by 80
Graph Embeddings and Laplacian Eigenvalues
Guattery, S., & Miller, G. L. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479897329825 · Cited by 63
Dakua, S. P., & Sahambi, J. S. (2010) · Cardiovascular Engineering An International Journal · doi:10.1007/s10558-009-9091-2 · Cited by 61
Random walks on weighted graphs, and applications to on-line algorithms
Coppersmith, D., Doyle, P. G., Raghavan, P., & Snir, M. (1990) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/100216.100266 · Cited by 59
Self-citationA New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties
Young, G. F., Scardovi, L., & Leonard, N. E. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2481978 · Cited by 60
Applications of Laplacian spectra for n-prism networks
Liu, J., Cao, J., Alofi, A. S., Al-Mazrooei, A., & Elaiw, A. M. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.06.109 · Cited by 60
Inferring models of gene expression dynamics
Perkins, T. J., Hallett, M., & Glass, L. (2004) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2004.05.022 · Cited by 60
Simple random walk on the uniform infinite planar quadrangulation: subdiffusivity via pioneer points
Benjamini, I., & Curien, N. (2013) · Geometric and Functional Analysis · doi:10.1007/s00039-013-0212-0 · Cited by 57
The relationship between least-cost and resistance distance
Marrotte, R. R., & Bowman, J. (2017) · PLoS ONE · doi:10.1371/journal.pone.0174212 · Cited by 69
Luppi, A. I., Singleton, S. P., Hansen, J. Y., Jamison, K. W., Bzdok, D., Kuceyeski, A. F., Betzel, R. F., & Mišić, B. (2024) · Nature Biomedical Engineering · doi:10.1038/s41551-024-01242-2 · Cited by 73
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Stanković, L., Mandic, D. P., Daković, M., Brajović, M., Dees, B. S., Li, S., & Constantinides, A. G. (2020) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000078 · Cited by 65
Combinatorics of optimal designs
Bailey, R. A., & Cameron, P. J. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9781107325975.003 · Cited by 66
An Event-Triggered Approach for Gradient Tracking in Consensus-Based Distributed Optimization
Gao, L., Deng, S., Li, H., & Li, C. (2021) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2021.3122927 · Cited by 51
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
“Alternatively, it can be bounded from above by the maximum commute time, which in turn can be bounded by 2mD, where D is the diameter of the graph, or even characterized exactly by 2mRe , where Re is the maximum e ective resistance in the graph (see [6], and also Section 3).”
BackgroundNetwork coherence in fractal graphs
Patterson, S., & Bamieh, B. A. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6161307 · Cited by 46
Extrema of the Two-Dimensional Discrete Gaussian Free Field
Biskup, M. (2019) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-030-32011-9_3 · Cited by 49
Zaman, S. (2021) · International Journal of Computer Mathematics · doi:10.1080/00207160.2021.1919303 · Cited by 45
Integrative Structural Brain Network Analysis in Diffusion Tensor Imaging
Chung, M. K., Hanson, J. L., Adluru, N., Alexander, A. L., Davidson, R. J., & Pollak, S. D. (2017) · Brain Connectivity · doi:10.1089/brain.2016.0481 · Cited by 43
Yu, X., Zaman, S., Ullah, A., Saeedi, G., & Zhang, X. (2023) · IEEE Access · doi:10.1109/access.2023.3240468 · Cited by 43
Robust Graph Topologies for Networked Systems
Abbas, W., & Egerstedt, M. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120914-2-us-4030.00052 · Cited by 43
Mean first-passage time for random walks on generalized deterministic recursive trees
Comellas, F., & Miralles, A. (2010) · Physical Review E · doi:10.1103/physreve.81.061103 · Cited by 45
Cover times, blanket times, and majorizing measures
Ding, J., Lee, J. R., & Peres, Y. (2011) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1993636.1993646 · Cited by 53
On the Cover Time of Planar Graphs
Jonasson, J., & Schramm, O. (2000) · Electronic Communications in Probability · doi:10.1214/ecp.v5-1022 · Cited by 43
Time-Efficient Quantum Walks for 3-Distinctness
Belovs, A., Childs, A. M., Jeffery, S., Kothari, R., & Magniez, F. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39206-1_10 · Cited by 48
Kemeny's constant and global mean first passage time of random walks on octagonal cell network
Zaman, S., & Ullah, A. (2023) · Mathematical Methods in the Applied Sciences · doi:10.1002/mma.9046 · Cited by 41
Random walks and flights over connected graphs and complex networks
Volchenkov, D. (2010) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2010.02.016 · Cited by 44
Transition density estimates for diffusion processes on homogeneous random Sierpinski carpets
Hambly, B. M., Kumagai, T., Kusuoka, S., & Zhou, X. Y. (2000) · Journal of the Mathematical Society of Japan · doi:10.2969/jmsj/05220373 · Cited by 40
Random multi-hopper model: super-fast random walks on graphs
Estrada, E., Delvenne, J., Hatano, N., Mateos, J. L., Metzler, R., Riascos, A. P., & Schaub, M. T. (2017) · Journal of Complex Networks · doi:10.1093/comnet/cnx043 · Cited by 47
Rumor spreading and vertex expansion on regular graphs
Sauerwald, T., & Stauffer, A. O. (2011) · doi:10.5555/2133036.2133073 · Cited by 39
Analysis of Latency of Stateless Opportunistic Forwarding in Intermittently Connected Networks
Chau, C.-K., & Basu, P. (2011) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2010.2103321 · Cited by 39
Determining the underlying structure of insular isolation measures
Carter, Z. T., Perry, G. L. W., & Russell, J. C. (2020) · Journal of Biogeography · doi:10.1111/jbi.13778 · Cited by 40
Modularity and Dynamics on Complex Networks
Lambiotte, R., & Schaub, M. T. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108774116 · Cited by 62
Graph coarsening: from scientific computing to machine learning
Chen, J., Saad, Y., & Zhang, Z. (2022) · SeMA Journal · doi:10.1007/s40324-021-00282-x · Cited by 78
The resistance perturbation distance: A metric for the analysis of dynamic networks
Monnig, N. D., & Meyer, F. G. (2017) · Discrete Applied Mathematics · doi:10.1016/j.dam.2017.10.007 · Cited by 41
Communication Lower Bounds via Critical Block Sensitivity
Göös, M., & Pitassi, T. (2018) · SIAM Journal on Computing · doi:10.1137/16m1082007 · Cited by 35
Coherence in a family of tree networks with an application of Laplacian spectrum
Sun, W., Ding, Q., Zhang, J., & Chen, F. (2014) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4897568 · Cited by 34
The simplex geometry of graphs
Devriendt, K., & Mieghem, P. V. (2019) · Journal of Complex Networks · doi:10.1093/comnet/cny036 · Cited by 42
Study on the normalized Laplacian of a penta‐graphene with applications
Li, Q., Zaman, S., Sun, W., & Alam, J. (2020) · International Journal of Quantum Chemistry · doi:10.1002/qua.26154 · Cited by 35
Oleksa, A., Chybicki, I. J., Larsson, M. C., Svensson, G. P., & Gawroński, R. (2015) · Journal of Insect Conservation · doi:10.1007/s10841-015-9778-1 · Cited by 42
Woodland networks in a changing climate: Threats from land use change
Gimona, A., Poggio, L., Brown, I. M., & Castellazzi, M. (2012) · Biological Conservation · doi:10.1016/j.biocon.2012.01.060 · Cited by 33
Graph Signal Processing -- Part I: Graphs, Graph Spectra, and Spectral ClusteringPreprint
Stanković, L., Mandic, D. P., Daković, M., Brajović, M., Dees, B. S., & Constantinides, T. G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.03467 · Cited by 59
The Kemeny’s Constant and Spanning Trees of Hexagonal Ring Network
Zaman, S., Koam, A. N. A., Khabyah, A. A., & Ahmad, A. H. (2022) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2022.031958 · Cited by 30
Quantum Walks and Electric NetworksPreprint
Belovs, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.3143 · Cited by 76
Scaling Laws for Consensus Protocols Subject to Noise
Jadbabaie, A., & Olshevsky, A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2863203 · Cited by 32
Low-Mean Hitting Time for Random Walks on Heterogeneous Networks
Sheng, Y., & Zhang, Z. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2925610 · Cited by 32
Effective resistance is more than distance: Laplacians, Simplices and the Schur complement
Devriendt, K. (2022) · Linear Algebra and its Applications · doi:10.1016/j.laa.2022.01.002 · Cited by 29
Asymptotics of cover times via Gaussian free fields: Bounded-degree graphs and general trees
Ding, J. (2014) · The Annals of Probability · doi:10.1214/12-aop822 · Cited by 51
Efficient quantum algorithms for analyzing large sparse electrical networks
Wang, G. (2017) · Quantum Information and Computation · doi:10.26421/qic17.11-12-5 · Cited by 53
Sherpa, S., Renaud, J., Guéguen, M., Besnard, G., Mouyon, L., Rey, D., & Després, L. (2020) · Journal of Animal Ecology · doi:10.1111/1365-2656.13284 · Cited by 33
Accelerating advances in landscape connectivity modelling with the ConScape library
Moorter, B. F. A. V., Kivimäki, I., Noack, A., Devooght, R., Panzacchi, M., Hall, K. R., Leleux, P., & Saerens, M. (2022) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.13850 · Cited by 32
Random Walks in Distributed Computing: A Survey
Bui, M., Bernard, T., Sohier, D., & Bui, A. (2006) · Lecture notes in computer science · doi:10.1007/11553762_1 · Cited by 28
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Chau, C.-K., & Basu, P. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5061992 · Cited by 32
Yi, Y., Zhang, Z., Lin, Y., & Chen, G. (2015) · The Computer Journal · doi:10.1093/comjnl/bxv014 · Cited by 27
Speeding up random walks with neighborhood exploration
Berenbrink, P., Cooper, C., Radzik, T., Elsässer⋆, R., & Sauerwald, T. (2012) · Cited by 26
On the resistance diameter of hypercubes
Sardar, M. S., Hua, H., Pan, X.-F., & Raza, H. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.123076 · Cited by 26
The Cover Time of Deterministic Random Walks
Friedrich, T., & Sauerwald, T. (2010) · The Electronic Journal of Combinatorics · doi:10.37236/439 · Cited by 25
Resistance distances in Cayley graphs on symmetric groups
Vaskouski, M. M., & Zadorozhnyuk, A. O. (2017) · Discrete Applied Mathematics · doi:10.1016/j.dam.2017.04.044 · Cited by 28
Finch, D., Corbacho, D. P., Schofield, H., Davison, S., Wright, P. G. R., Broughton, R. K., & Mathews, F. (2020) · Landscape Ecology · doi:10.1007/s10980-019-00953-1 · Cited by 30
Local Algorithms for Estimating Effective Resistance
Peng, P., Lopatta, D., Yoshida, Y., & Goranci, G. (2021) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3447548.3467361 · Cited by 24
Distributed flow optimization and cascading effects in weighted complex networks
Asztalos, A., Sreenivasan, S., Szymanski, B. K., & Korniss, G. (2012) · The European Physical Journal B · doi:10.1140/epjb/e2012-30122-3 · Cited by 23
The entire mean weighted first-passage time on infinite families of weighted tree networks
Sun, Y., Dai, M., Shao, S., & Su, W. (2017) · Modern Physics Letters B · doi:10.1142/s021798491750049x · Cited by 23
Property analysis and coherence dynamics for tree-symmetric networks with noise disturbance
Liu, J., Guan, L., & Cao, J. (2024) · Journal of Complex Networks · doi:10.1093/comnet/cnae029 · Cited by 22
Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks
Shang, Y. (2012) · Internet Mathematics · doi:10.1080/15427951.2012.685685 · Cited by 23
Graph-Theoretic Analysis of Belief System Dynamics under Logic Constraints
Nedić, A., Olshevsky, A., & Uribe, C. A. (2019) · Scientific Reports · doi:10.1038/s41598-019-45076-4 · Cited by 25
Tight Bounds for the Cover Time of Multiple Random Walks
Elsässer⋆, R., & Sauerwald, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02927-1_35 · Cited by 22
Quantum algorithms for graph connectivity and formula evaluation
Jeffery, S., & Kimmel, S. (2017) · Quantum · doi:10.22331/q-2017-08-17-26 · Cited by 43
Random Graphs, Phase Transitions, and the Gaussian Free Field
Barlow, M., & Slade, G. (2019) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-030-32011-9 · Cited by 21
A Unified Framework of Quantum Walk Search
Apers, S., Gilyén, A., & Jeffery, S. (2019) · Leibniz international proceedings in informatics · doi:10.4230/lipics.stacs.2021.6 · Cited by 44
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.