Rotor Walks and Markov Chains

zbMath1217.82042arXiv0904.4507MaRDI QIDQ3062355

Alexander E. Holroyd, James Propp

Publication date: 3 January 2011

Full work available at URL: https://arxiv.org/abs/0904.4507

zbMATH Keywords

random walksgraphsself-organized criticality

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Random walks on graphs (05C81)

Related Items (29)

Multi-Eulerian tours of directed graphs ⋮ Abelian networks. III: The critical group ⋮ Abelian networks IV. Dynamics of nonhalting networks ⋮ Exact computation and approximation of stochastic and analytic parameters of generalized Sierpinski gaskets ⋮ The Range of a Rotor Walk ⋮ Total variation discrepancy of deterministic random walks for ergodic Markov chains ⋮ A rotor configuration with maximum escape rate ⋮ Deterministic Random Walks for Rapidly Mixing Chains ⋮ Unnamed Item ⋮ A greedy chip‐firing game ⋮ On Torsor Structures on Spanning Trees ⋮ Recurrence of horizontal-vertical walks ⋮ Algorithmic aspects of rotor-routing and the notion of linear equivalence ⋮ Proppian random walks in \(\mathbb Z\) ⋮ Laplacian growth, sandpiles, and scaling limits ⋮ Proportionate growth in patterns formed in the rotor-router model ⋮ Spiral structures in the rotor-router walk ⋮ Reachability Switching Games ⋮ Orbits of rotor-router operation and stationary distribution of random walks on directed graphs ⋮ Infinite excursions of router walks on regular trees ⋮ Combinatorial, piecewise-linear, and birational homomesy for products of two chains ⋮ Rotor Walks on Transient Graphs and the Wired Spanning Forest ⋮ Abelian Networks I. Foundations and Examples ⋮ Fast Simulation of Large-Scale Growth Models ⋮ Abelian Logic Gates ⋮ The cover time of deterministic random walks for general transition probabilities ⋮ Infinite-step stationarity of rotor walk and the wired spanning forest ⋮ Does adding more agents make a difference? A case study of cover time for the rotor-router ⋮ Minimalist art from cellular automata

This page was built for publication: Rotor Walks and Markov Chains