The multi-agent rotor-router on the ring

DOI10.1145/2484239.2484260zbMath1323.68420OpenAlexW1987834484MaRDI QIDQ5176115

Dominik Pająk, Thomas Sauerwald, Ralf Klasing, Adrian Kosowski

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

ringrandom walkrotor walkgraph explorationpropp machineparallel exploration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15) Random walks on graphs (05C81)

Related Items (5)

Bounds on the cover time of parallel rotor walks ⋮ The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks ⋮ Robustness of the rotor-router mechanism ⋮ Multiple random walks on graphs: mixing few to cover many ⋮ Unbounded Discrepancy of Deterministic Random Walks on Grids

This page was built for publication: The multi-agent rotor-router on the ring