A rotor configuration with maximum escape rate
From MaRDI portal
Publication:2183118
Abstract: Rotor walk is a deterministic analogue of simple random walk. For any given graph, we construct a rotor configuration for which the escape rate of the corresponding rotor walk is equal to the escape rate of simple random walk, and thus answer a question of Florescu, Ganguly, Levine, and Peres (2014).
Recommendations
Cites work
- Escape rates for rotor walks in \(\mathbb{Z}^d\)
- Exponentiation and Euler measure
- Internal aggregation models on comb lattices
- Probability on trees and networks
- Rotor walks and Markov chains
- Rotor walks on general trees
- Rotor walks on transient graphs and the wired spanning forest
- Rotor-router aggregation on the comb
- The rotor-router model on regular trees
Cited in
(5)
This page was built for publication: A rotor configuration with maximum escape rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183118)