Limit behavior of the multi-agent rotor-router system
From MaRDI portal
Publication:1664136
DOI10.1007/978-3-662-48653-5_9zbMATH Open1394.68031OpenAlexW2284315852MaRDI QIDQ1664136FDOQ1664136
Authors: J. Chalopin, Shantanu Das, Paweł Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemysław Uznański 
Publication date: 24 August 2018
Full work available at URL: https://doi.org/10.1007/978-3-662-48653-5_9
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
Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81) Distributed systems (68M14)
Cited In (8)
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
- Does adding more agents make a difference? A case study of cover time for the rotor-router
- Robustness of the rotor-router mechanism
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation)
- Total variation discrepancy of deterministic random walks for ergodic Markov chains
- Euler Tour Lock-In Problem in the Rotor-Router Model
- Deterministic Random Walks for Rapidly Mixing Chains
- The cover time of deterministic random walks for general transition probabilities
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)
