On a random walk problem arising in self-stabilizing token management

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 1991, Pages 273-280

  Tetali, Prasad ^a   Winkler, Peter ^b  

^a NEW YORK UNIVERSITY   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; POLYNOMIAL APPROXIMATION;

EXPECTED TIME; MANAGEMENT PROTOCOLS; N-VERTEX GRAPH; POLYNOMIAL-TIME; POTENTIAL FUNCTION; RANDOM WALK; RANDOM-WALK PROBLEM;

RANDOM PROCESSES;

EID: 84987523420     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/112600.112623     Document Type: Conference Paper

References (16)

1. D.J. Aldous, Applications of random walks on graphs, preprint (1989).
2. D.J. Aldous, Bibliography: random walks on graphs, preprint (1989).
3. D.J. Aldous, Meeting times for independent Markov chains, Stocastic Processes and Applications (1991), to appear.
4. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz, and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico (October 1979), 218-223.
5. K. Borre and P. Meissl, Strength Analysis of Leveling-type Networks, Geodaetisk In-stitut, Copenhagen (1974), vol. 50.
6. G. Brightwell and P. Winkler, Maximum hitting time for random walks on graphs, J. Random Structures and Algorithms No. 3 (1990), 263-276.
7. A.Z. Broder, How hard is it to marry at random? (on the approximation of the permanent), 18th Annual ACM Symposium on Theory of Computing (1986), 50-58.
8. D. Coppersmith, Private Communication.
9. D. Coppersmith, P. Doyle, P. Ragh avan and M. Snir, Random walks on weighted graphs, and applications to on-line algorithms, Proc. 22nd Annual ACM Symposium on Theory of Computing (1990), 369¬ 378.
10. P. Dagum, M. Luby, M. Mihail, and U. Vazirani, Polytopes, permanents and graphs with large factors, 29th Annual IEEE Symposium on Foundations of Computer Science (1989), 412-421.
11. P.G. Doyle and J.L. Snell, Random Walks and Electric Networks, Mathematical Assoc. of America (1974), Washington, DC.
12. M. Dyer, A. Frieze and R. Kannan, A random polynomial time algorithm for estimating volumes of convex bodies, Proc. 21st Annual ACM Symposium on the Theory of Computing (1989), 375-381.
13. A. Israeli and M. Jalfon, Token management schemes and random walks yield self stabilizing mutual exclusion, Proc. 9th Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Canada (1990), 119-131.
14. M. Jerrum and A. Sinclair, Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved, Proc. 20nd Annual ACM Symposium on Theory of Computing (1988), 235-243.
15. A. Karzanov and L. Khachiyan, On the conductance of order Markov chains, Technical Report DCS TR 268, Rutgers University, June 1990.
16. P. Tetali, Random walks and effective resistance of networks, J. Theoretical Prob. No. 1 (1991), 101-109.