Discrete analog computing with rotor-routers

DOI10.1063/1.3489886zbMath1311.68019arXiv1007.2389OpenAlexW2000373321WikidataQ51610971 ScholiaQ51610971MaRDI QIDQ5251239

James Propp

Publication date: 19 May 2015

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distributed systems (68M14)

Related Items (3)

A growth model based on the arithmetic \(Z\)-game ⋮ Proportionate growth in patterns formed in the rotor-router model ⋮ Abelian Networks I. Foundations and Examples

Cites Work

• Unnamed Item
• Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile
• Random walks, capacity and percolation on trees
• Internal diffusion limited aggregation
• The probabilistic abacus
• Why does the probabilistic abacus work?
• Internal diffusion-limited aggregation: parallel algorithms and complexity
• Goldbug variations
• Deterministic random walks on the integers
• Simulating a Random Walk with Constant Error
• Deterministic Random Walks on the Two-Dimensional Grid

This page was built for publication: Discrete analog computing with rotor-routers