Bounds on the cover time of parallel rotor walks
From MaRDI portal
Publication:2965489
DOI10.4230/LIPICS.STACS.2014.263zbMATH Open1359.68231OpenAlexW2249952845MaRDI QIDQ2965489FDOQ2965489
Authors: Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemysław Uznański
Publication date: 3 March 2017
Full work available at URL: https://hal.science/hal-00865065
Recommendations
- Bounds on the cover time of parallel rotor walks
- 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
- Does adding more agents make a difference? A case study of cover time for the rotor-router
Cited In (10)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
- Bounds on the cover time of parallel rotor walks
- 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)
- Unbounded discrepancy of deterministic random walks on grids
- Limit behavior of the multi-agent rotor-router system
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
- Coalescing walks on rotor-router systems
- Total variation discrepancy of deterministic random walks for ergodic Markov chains
This page was built for publication: Bounds on the cover time of parallel rotor walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965489)