Meeting times of random walks on graphs

Information Processing Letters

Volumn 69, Issue 5, 1999, Pages 259-265

  Bshouty, Nader H ^a   Higham, Lisa ^a   Warpechowska Gruca, Jolanta ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; RANDOM PROCESSES; THEOREM PROVING;

RANDOM WALKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0033548333     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00017-4     Document Type: Article

References (5)

1. [1] D. Aldous, Meeting times for independent Markov chains, Stochastic Processes Appl. 38 (1991) 185-193.
2. [2] D. Coppersmith, P. Tetali, P. Winkler, Collisions among random walks, Manuscript, 1992.
3. [3] A. Israeli, M. Jalfon, Token management schemes and random walks yield self stabilizing mutual exclusion, in: Proc. 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 119-131.
4. [4] P. Tetali, P. Winkler, On a random walk problem arising in self-stabilizing token management, in: Proc. 10th Annual ACM Symposium on Principles of Distributed Computing, 1991, pp. 273-280.
5. [5] J. Warpechowska-Gruca, Meeting times of random walks on graphs, Technical Report 94/535/04, University of Calgary, 1994.