Does adding more agents make a difference? A case study of cover time for the rotor-router
From MaRDI portal
Publication:2323346
DOI10.1016/j.jcss.2019.07.001zbMath1429.68311OpenAlexW2957664767WikidataQ127495128 ScholiaQ127495128MaRDI QIDQ2323346
Adrian Kosowski, Dominik Pająk
Publication date: 30 August 2019
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00950743v3/file/rrcases.pdf
Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81) Agent technology and artificial intelligence (68T42)
Related Items (2)
Termination of amnesiac flooding ⋮ Exploration of dynamic networks: tight bounds on the number of agents
Cites Work
- Bounds on the cover time of parallel rotor walks
- Tight bounds for the cover time of multiple random walks
- The cover time of deterministic random walks
- Randomized diffusion for indivisible loads
- Faster mixing and small bottlenecks
- Covering problems for Brownian motion on spheres
- The electrical resistance of a graph captures its commute and cover times
- Limit behavior of the multi-agent rotor-router system
- A distributed ant algorithm for efficiently patrolling a network
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
- Deterministic random walks on the integers
- Rotor Walks and Markov Chains
- Quasirandom Load Balancing
- Deterministic Random Walks on the Two-Dimensional Grid
- How Well Do Random Walks Parallelize?
- Euler Tour Lock-In Problem in the Rotor-Router Model
- A Technique for Lower Bounding the Cover Time
- A tight upper bound on the cover time for random walks on graphs
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
- Many Random Walks Are Faster Than One
- Deterministic random walks on finite graphs
This page was built for publication: Does adding more agents make a difference? A case study of cover time for the rotor-router
