Eulerian Walkers as a model of Self-Organised Criticality

Abstract

We propose a new model of self-organized criticality. A particle is dropped at random on a lattice and moves along directions specified by arrows at each site. As it moves, it changes the direction of the arrows according to fixed rules. On closed graphs these walks generate Euler circuits. On open graphs, the particle eventually leaves the system, and a new particle is then added. The operators corresponding to particle addition generate an abelian group, same as the group for the Abelian Sandpile model on the graph. We determine the critical steady state and some critical exponents exactly, using this equivalence.

4 pages, RevTex, 4 figures

Cited by in corpus (64)

• The abelian sandpile and related models
• 25 Years of Self-Organized Criticality: Solar and Astrophysics
• Chip-Firing and Rotor-Routing on Directed Graphs
• Strong Spherical Asymptotics for Rotor-Router Aggregation and the Divisible Sandpile
• Scaling Limits for Internal Aggregation Models with Multiple Sources
• The Rotor-Router Model on Regular Trees
• Dynamics of Eulerian walkers
• Transience and recurrence of rotor-router walks on directed covers of graphs
• Dynamic correlations in the conserved Manna sandpile
• A sandpile model for proportionate growth
• Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
• Pattern formation in fast-growing sandpiles
• Deterministic Random Walks on Regular Trees
• A Loop Reversibility and Subdiffusion of the Rotor-Router Walk
• Hydrodynamics, density fluctuations and universality in conserved stochastic sandpiles
• Rotor-routing and spanning trees on planar graphs
• Self-organized random walks and stochastic sandpile: From linear to branched avalanches
• Asymptotic shape of the region visited by an Eulerian Walker
• A growth model based on the arithmetic $Z$-game
• Limit Theorems for Internal Aggregation Models
• Critical Dynamics of Self-Organizing Eulerian Walkers
• Abelian sandpile model and Biggs-Merino polynomial for directed graphs
• Lock-in Problem for Parallel Rotor-router Walks
• One-dimensional general forest fire processes
• Interface growth driven by a single active particle
• Proportionate growth in patterns formed in the rotor-router model
• The Cover Time of Deterministic Random Walks
• Abelian networks IV. Dynamics of nonhalting networks
• Discrete analogue computing with rotor-routers
• Spiral Structures in the Rotor-Router Walk
• Rotor-Router Walk on a Semi-infinite Cylinder
• Rotor walks on transient graphs and the wired spanning forest
• A Subexponential Algorithm for ARRIVAL
• A rotor configuration with maximum escape rate
• Random walks with local memory
• Local-to-global principles for rotor walk
• Quasi-random Agents for Image Transition and Animation
• Solution manifold and Its Statistical Applications
• Escape rates for rotor walk in Z^d
• Uniform threshold for fixation of the stochastic sandpile model on the line
• Reachability Switching Games
• Rotor-Routing Induces the Only Consistent Sandpile Torsor Structure on Plane Graphs
• Euler tours and unicycles in the rotor-router model
• Emergence and complexity in theoretical models of self-organized criticality
• Improved Analysis of Deterministic Load-Balancing Schemes
• Rotor walks on general trees
• Recurrence of horizontal-vertical walks
• A rotor configuration in Z^d where Schramm's bound of escape rates attains
• Internal Aggregation Models on Comb Lattices
• Rotor-router aggregation on the layered square lattice
• A novel Recurrence-Transience transition and Tracy-Widom growth in a cellular automaton with quenched noise
• Euler Walk on a Cayley Tree
• Emergence of quasi-units in the one dimensional Zhang model
• Sandpiles, spanning trees, and plane duality
• Rotor-routing orbits in directed graphs and the Picard group
• The rotor-router group of directed covers of graphs
• Efficient Dispersion of Mobile Agents without Global Knowledge
• Determining Genus From Sandpile Torsor Algorithms
• Multi-Eulerian tours of directed graphs
• A Greedy Chip-firing Game
• Infinite excursions of rotor walks on regular trees
• On the Classification of Universal Rotor-Routers
• Perfect boundaries in rotor-router aggregation on cylinders
• Quasirandom Rumor Spreading