Limit behavior of the multi-agent rotor-router system
From MaRDI portal
Publication:1664136
Recommendations
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
- Bounds on the cover time of parallel rotor walks
- Coalescing walks on rotor-router systems
- Deterministic random walks on finite graphs
Cited in
(11)- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
- Total variation discrepancy of deterministic random walks for ergodic Markov chains
- Does adding more agents make a difference? A case study of cover time for the rotor-router
- Distributed patrolling with two-speed robots (and an application to transportation)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
- Euler Tour Lock-In Problem in the Rotor-Router Model
- Coalescing walks on rotor-router systems
- Deterministic random walks for rapidly mixing chains
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
- Discrete analog computing with rotor-routers
- Robustness of the rotor-router mechanism
This page was built for publication: Limit behavior of the multi-agent rotor-router system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664136)