Meeting times of random walks on graphs
From MaRDI portal
Publication:294672
DOI10.1016/S0020-0190(99)00017-4zbMath1338.68213MaRDI QIDQ294672
Nader H. Bshouty, Jolanta Warpechowska-Gruca, Lisa Higham
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099000174?np=y
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81)
Related Items (5)
Meeting times of random walks on graphs ⋮ Randomized uniform self-stabilizing mutual exclusion ⋮ Quantized consensus in Hamiltonian graphs ⋮ The survival of the weakest in networks ⋮ Exact computation for meeting times and infection times of random walks on graphs
Cites Work
This page was built for publication: Meeting times of random walks on graphs