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

DOI10.1145/112600.112623MaRDI QIDQ5255826zbMATH OpenOpenAlexFDO

Authors Peter 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) Random walks on graphs (05C81) Distributed systems (68M14) Network protocols (68M12)

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255826)