Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari  Home/Search
Context Related
Links: ACM DBLP | 128.95.4.112/homes/ruzzo/pa...resist.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: 128.95.4.112/homes/ruzzo/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 =... (Update)
Cited by: More
Automatic Extraction of Relevant Nodes in Biochemical Networks - Vast, Dupont, Deville (Correct)
Semisupervised Alignment of Manifolds - Jihun Ham Systems (2004) (Correct)
On the Cover Time of Random Geometric Graphs (Extended Abstract) - Avin, Ercal (2004) (Correct)
Active bibliography (related documents): More All
0.5: Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
0.5: Short Random Walks On Graphs - Barnes, Feige (1993) (Correct)
0.4: A Technique for Lower Bounding the Cover Time - Zuckerman (1992) (Correct)
Similar documents based on text: More All
1.8: The Electrical Resistance - Of Graph Captures (Correct)
0.5: The Cover Time of Sparse Random Graphs. - Cooper, Frieze (2002) (Correct)
0.5: The Cover Time of Random Regular Graphs - Cooper, Frieze (2003) (Correct)
Related documents from co-citation: More All
23: Reversible Markov Chains and Random Walks on Graphs (context) - Aldous, Fill - 1996
20: Random Walks and the Effective Resistance of Networks (context) - Tetali - 1991
17: Mathematical Association of America (context) - Doyle, Snell et al. - 1984
BibTeX entry: (Update)
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 Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 574--586, Seattle, WA, May 1989. http://citeseer.ist.psu.edu/chandra89electrical.html More
@inproceedings{ chandra89electrical,
author = "A. K. Chandra and P. Raghavan and W. L. Ruzzo and R. Smolensky",
title = "The electrical resistance of a graph captures its commute and cover times",
pages = "574--586",
year = "1989",
url = "citeseer.ist.psu.edu/chandra89electrical.html" }
Citations (may not include all citations):160 Introduction to Probability Models (context) - Ross - 1989
126 Eigenvalues and expanders (context) - Alon - 1986 DBLP
115 Approximating the permanent (context) - Jerrum, Sinclair - 1989 ACM DBLP
113 Reversible Markov chains and random walks on graphs (context) - Aldous - 1993
98 A random polynomial-time algorithm for approximating the vol.. - Dyer, Frieze et al. - 1991 ACM
68 The electrical resistance of a graph captures its commute an.. - Chandra, Raghavan et al. - 1989 ACM DBLP
65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
56 The Mathematical Association of America (context) - Doyle, Snell et al. - 1984
48 Two applications of inductive counting for complementation p.. (context) - Borodin, Cook et al. - 1989 ACM DBLP
33 A Treatise on Electricity and Magnetism (context) - Maxwell - 1918
24 Random walks and effective resistance of networks (context) - Tetali - 1991
23 Covering problems for Brownian motion on spheres (context) - Matthews - 1988
21 Short random walks on graphs - Barnes, Feige - 1996 ACM DBLP
20 Bounds on the cover time - Broder, Karlin - 1989
20 the cover time of random walks on graphs (context) - Kahn, Linial et al. - 1989
18 Constructing disjoint paths on expander graphs (context) - Peleg, Upfal - 1989 ACM
14 Lower bounds on the length of universal traversal sequences (context) - Borodin, Ruzzo et al. - 1992 ACM DBLP
14 Trading space for time in undirected s-t connectivity - Broder, Karlin et al. - 1994 DBLP
11 Expanding graphs contain all small trees (context) - Friedman, Pippenger - 1987 ACM DBLP
9 Matrix Theory (context) - Franklin - 1968
8 Stochastic Processes and their Applications (context) - obel, Jagers et al. - 1974
8 the time taken by random walks on finite groups to visit eve.. (context) - Aldous - 1983
6 Bounds for eigenvalues of certain stochastic matrices (context) - Landau, Odlyzko - 1981
5 Coalescing random walks and voter model consensus times on t.. (context) - Cox - 1989
4 A randomized time-space tradeoff o (context) - Feige - 1993
2 The fundamental theorem of electrical networks (context) - Synge - 1951
1 the time to traverse all edges of a graph (context) - Thomson, Tait et al. - 1991
1 The cover time of a regular expander is O (context) - Commute, Rubinfeld - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://128.95.4.112/homes/ruzzo/): More
Algorithms for Ordering DNA Probes on Chromosomes - Joshua Redstone (1998) (Correct)
Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
Validating Clustering for Gene Expression Data - Yeung Computer Science (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC