Rotor Walks on Transient Graphs and the Wired Spanning Forest
From MaRDI portal
Publication:5204068
DOI10.1137/18M1217139zbMath1428.05287arXiv1809.09790WikidataQ126593393 ScholiaQ126593393MaRDI QIDQ5204068
Publication date: 9 December 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.09790
stationary distributionrotor walkuniform spanning forestwired spanning foresttransience and recurrencerotor router
Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Random walks on graphs (05C81)
Related Items
A rotor configuration with maximum escape rate, Recurrence of horizontal-vertical walks, Infinite-step stationarity of rotor walk and the wired spanning forest, Range and speed of rotor walks on trees
Cites Work
- Occupation measure of random walks and wired spanning forests in balls of Cayley graphs
- The rotor-router model on regular trees
- Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Choosing a spanning tree for the integer lattice uniformly
- Generating random elements of finite distributive lattices
- Uniform spanning forests
- Recurrent rotor-router configurations
- Random walks with local memory
- Erratum to: ``Transience and recurrence of rotor-router walks on directed covers of graphs
- Rotor-routing on Galton-Watson trees
- Probability on Trees and Networks
- Rotor Walks and Markov Chains
- Rotor Walks on General Trees
- Simulating a Random Walk with Constant Error
- Chip-Firing and Rotor-Routing on Directed Graphs
- An elementary proof of the strong law of large numbers
- Self-organized critical state of sandpile automaton models
- Undirected and directed graphs with near polynomial growth
- Isoperimetric Inequalities and Decay of Iterated Kernels for Almost-transitive Markov Chains
- Escape Rates for Rotor Walks in $\mathbb{Z}^d$
- Abelian networks IV. Dynamics of nonhalting networks
- Deterministic Random Walks
- Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding
