Coalescing Walks on Rotor-Router Systems

DOI10.1007/978-3-319-25258-2_31zbMath1471.68030OpenAlexW2232715119MaRDI QIDQ3460734

Tomasz Radzik, Takeharu Shiraga, Nicolás Rivera, Colin Cooper

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_31

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Tight bounds for the cover time of multiple random walks
• Meeting times for independent Markov chains
• A distributed ant algorithm for efficiently patrolling a network
• Robustness of the rotor-router mechanism
• Bounds on the Cover Time of Parallel Rotor Walks
• Multiple Random Walks in Random Regular Graphs
• How Well Do Random Walks Parallelize?
• Euler Tour Lock-In Problem in the Rotor-Router Model
• Traversing Directed Eulerian Mazes
• Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
• Many Random Walks Are Faster Than One
• On the coalescence time of reversible random walks
• Coalescing Random Walks and Voting on Connected Graphs

This page was built for publication: Coalescing Walks on Rotor-Router Systems