# The electrical resistance of a graph captures its commute and cover times

- 594 Downloads
- 84 Citations

## Abstract

View an*n*-vertex,*m*-edge undirected graph as an electrical network with unit resistors as edges. We extend known relations between random walks and electrical networks by showing that resistance in this network is intimately connected with the*lengths* of random walks on the graph. For example, the*commute time* between two vertices*s* and*t* (the expected length of a random walk from*s* to*t* and back) is precisely characterized by the effective resistance*R*_{ st } between*s* and*t*: commute time=2*mR*_{ st }. As a corollary, the*cover time* (the expected length of a random walk visiting all vertices) is characterized by the maximum resistance*R* in the graph to within a factor of log*n*:*mR*<-cover time<-*O*(*mR*log*n*). For many graphs, the bounds on cover time obtained in this manner are better than those obtained from previous techniques such as the eigenvalues of the adjacency matrix. In particular, we improve known bounds on cover times for high-degree graphs and expanders, and give new proofs of known results for multi-dimensional meshes. Moreover, resistance seems to provide an intuitively appealing and tractable approach to these problems.

## Key words

Random walk resistance cover time commute time## Subject classifications

60J15 68Q99## Preview

Unable to display preview. Download preview PDF.

## References

- D. J. Aldous, On the time taken by random walks on finite groups to visit every state.
*Z. Wahrsch. Verw. Gebiete***62**(3) (1983), 361–374.Google Scholar - D. J. Aldous,
*Reversible Markov chains and random walks on graphs*. 1993. Draft, University of California, Berkeley.Google Scholar - R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. W. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems. In
*Proc. 20th Ann. IEEE Symp. Found. Comput. Sci.*, San Juan, Puerto Rico, 1979, IEEE, 218–223.Google Scholar - G. Barnes andU. Feige, Short random walks on graphs.
*SIAM J. Disc. Math.***9**(1) (1996), 19–28.Google Scholar - A. Borodin, S. A. Cook, P. W. Dymond, W. L. Ruzzo, andM. Tompa, Two applications of inductive counting for complementation problems.
*SIAM J. Comput.***18**(3) (1989), 559–578. See also**18**(6): 1283, December 1989.Google Scholar - A. Borodin, W. L. Ruzzo, andM. Tompa, Lower bounds on the length of universal traversal sequences.
*J. Comput. System Sci.***45**(2) (1992), 180–203.Google Scholar - A. Z. Broder andA. R. Karlin, Bounds on the cover time.
*J. Theoret. Probability***2**(1) (1989), 101–120.Google Scholar - A. Z. Broder, A. R. Karlin, P. Raghavan, andE. Upfal, Trading space for time in undirected
*s-t*connectivity.*SIAM J. Comput.***23**(2) (1994), 324–334.Google Scholar - A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and P. Tiwari, The electrical resistance of a graph captures its commute and cover times. In
*Proc. Twenty-first Ann. ACM Symp. Theor. Comput.*, Seattle, WA, 1989, 574–586.Google Scholar - J. T. Cox, Coalescing random walks and voter model consensus times on the torus in
*Zd*.*The Annals of Probability***17**(4) (1989), 1333–1366.Google Scholar - P. G. Doyle, Personal communication, 1988.Google Scholar
- P. G. Doyle and J. L. Snell,
*Random Walks and Electrical Networks*. The Mathematical Association of America, 1984.Google Scholar - M. Dyer, A. M. Frieze, andR. Kannan, A random polynomial-time algorithm for approximating the volume of convex bodies.
*J. Assoc. Comput. Mach.***38**(1) (1991), 1–17.Google Scholar - U. Feige, A randomized time-space tradeoff of\(\tilde O(m\hat R)\) for USTCON. In
*Proc. 34th Ann. Symp. Found. Comput. Sci.*, Palo Alto, CA, 1993, IEEE, 238–246.Google Scholar - J. Friedman and N. J. Pippenger, Expanding graphs contain all small trees.
*Combinatorica*(1987), 71–76.Google Scholar - F. Göbel andA. A. Jagers, Random walks on graphs.
*Stochastic Processes and their Applications***2**(1974), 311–336.Google Scholar - M. Jerrum andA. Sinclair, Approximating the permanent.
*SIAM J. Comput.***18**(6) (1989), 1149–1178.Google Scholar - J. D. Kahn, N. Linial, N. Nisan, andM. E. Saks, On the cover time of random walks on graphs.
*J. Theoret. Probability***2**(1) (1989), 121–128.Google Scholar - H. J. Landau andA. M. Odlyzko, Bounds for eigenvalues of certain stochastic matrices.
*Linear Algebra and Its Applications***38**(1981), 5–15.Google Scholar - P. Matthews, Covering problems for Brownian motion on spheres.
*The Annals of Probability***16**(1) (1988), 189–199.Google Scholar - D. Peleg andE. Upfal, Constructing disjoint paths on expander graphs.
*Combinatorica***9**(3) (1989), 289–313.Google Scholar - R. Rubinfeld, The cover time of a regular expander is
*O*(*n*log*n*).*Inform. Process. Lett.***35**(1) (1990), 49–51.Google Scholar - J. L. Synge, The fundamental theorem of electrical networks.
*Quarterly of Applied Math.***9**(1951), 113–127.Google Scholar - P. Tetali, Random walks and effective resistance of networks.
*J. Theoret. Probability***4**(1) (1991), 101–109.Google Scholar - D. I. Zuckerman, On the time to traverse all edges of a graph.
*Inform. Process. Lett.***38**(6) (1991), 335–337.Google Scholar - D. I. Zuckerman, A technique for lower bounding the cover time.
*SIAM J. Disc. Math.***5**(1) (1992), 81–87.Google Scholar