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

DOI10.1145/112600.112623zbMath1314.05193OpenAlexW1967434633MaRDI QIDQ5255826

Peter M. Winkler, Prasad Tetali

Publication date: 19 June 2015

Published in: Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/112600.112623

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Network protocols (68M12) Random walks on graphs (05C81)

Related Items (9)

Meeting times of random walks on graphs ⋮ A note on the last new vertex visited by a random walk ⋮ On the robustness of a synchronized multi-robot system ⋮ Market sentiments and convergence dynamics in decentralized assignment economies ⋮ Distributed protocols against mobile eavesdroppers ⋮ Quantized consensus in Hamiltonian graphs ⋮ A multiple random walks based self-stabilizingk-exclusion algorithm in ad hoc networks ⋮ The survival of the weakest in networks ⋮ Non-uniform random spanning trees on weighted graphs

This page was built for publication: On a random walk problem arising in self-stabilizing token management