Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
From MaRDI portal
Publication:5167868
DOI10.1007/978-3-662-43951-7_46zbMath1411.68159OpenAlexW1603204637MaRDI QIDQ5167868
Adrian Kosowski, Dominik Pająk
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00950743
Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81) Agent technology and artificial intelligence (68T42)
Related Items (9)
Bounds on the cover time of parallel rotor walks ⋮ Coalescing Walks on Rotor-Router Systems ⋮ The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks ⋮ Robustness of the rotor-router mechanism ⋮ Deterministic Random Walks for Rapidly Mixing Chains ⋮ Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) ⋮ Unbounded Discrepancy of Deterministic Random Walks on Grids ⋮ The cover time of deterministic random walks for general transition probabilities ⋮ Does adding more agents make a difference? A case study of cover time for the rotor-router
This page was built for publication: Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
