Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
From MaRDI portal
Publication:494127
DOI10.1016/j.aam.2015.06.006zbMath1327.05235arXiv1403.5875OpenAlexW1596266736MaRDI QIDQ494127
Publication date: 31 August 2015
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.5875
spanning treestationary distributionrandom walkoriented spanning treerotor-router modelEulerian Walkerrecurrent state
Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Games on graphs (graph-theoretic aspects) (05C57) Random walks on graphs (05C81)
Related Items (8)
Sandpile groups and the coeulerian property for random directed graphs ⋮ Multi-Eulerian tours of directed graphs ⋮ Abelian networks IV. Dynamics of nonhalting networks ⋮ Perfect boundaries in rotor-router aggregation on cylinders ⋮ Algorithmic aspects of rotor-routing and the notion of linear equivalence ⋮ CoEulerian graphs ⋮ Rotor-routing reachability is easy, chip-firing reachability is hard ⋮ Random integral matrices: universality of surjectivity and the cokernel
Cites Work
This page was built for publication: Orbits of rotor-router operation and stationary distribution of random walks on directed graphs