Spherical asymptotics for the rotor-router model in Zd

@article{Levine2005SphericalAF,
  title={Spherical asymptotics for the rotor-router model in Zd},
  author={Lionel Levine and Yuval Peres},
  journal={Indiana University Mathematics Journal},
  year={2005},
  volume={57},
  pages={431-450}
}
The rotor-router model is a deterministic analogue of random walk invented by Jim Propp. It can be used to define a deterministic aggregation model analogous to internal diffusion limited aggregation. We prove an isoperimetric inequality for the exit time of simple random walk from a finite region in Z d , and use this to prove that the shape of the rotor-router aggregation model in Z d , suitably rescaled, converges to a Euclidean ball in R d . 
View PDF on arXiv
48 Citations
Highly Influential Citations
3
Background Citations
22
Methods Citations
8
Results Citations
3

Figures from this paper

48 Citations

Strong Spherical Asymptotics for Rotor-Router Aggregation and the Divisible Sandpile

The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We prove that the asymptotic shape of this model is…

Rotor-Router Aggregation on the Layered Square Lattice

It is shown that for a certain choice of initial rotors, the occupied cluster of occupied sites grows as a perfect diamond.

A loop reversibility and subdiffusion of the rotor-router walk

The rotor-router model on a graph describes a discrete-time walk accompanied by the deterministic evolution of configurations of rotors randomly placed on vertices of the graph. We prove the…

Chip-Firing and Rotor-Routing on Z d and on Trees

In the regular tree, the sandpile group is used to prove that rotor-router aggregation started from an acyclic initial condition yields a perfect ball, which is close to circular.

Deterministic Random Walks for Rapidly Mixing Chains

The discrepancy of the number of tokens at a single vertex between the functional-router model and its corresponding Markov chain is investigated, and an upper bound in terms of the mixing time of the MarkovChain is given.

Spiral structures in the rotor-router walk

We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper (Papoyan et al 2015 J. Phys. A: Math. Theor. 48…

The rotor-router model on regular trees

Limiting shapes for deterministic internal growth models

We study the rotor router model and two deterministic sandpile models. For the rotor router model in Z d , Levine and Peres proved that the limiting shape of the growth cluster is a sphere. For the…

Deterministic Random Walks

Jim Propp's P-machine, also known as 'rotor router model' is a simple deterministic process that simulates a random walk on a graph, which shows that, independent of the starting configuration, the number of chips on this vertex deviates from the expected number of Chips in the random walk model by at most a constant c1, which is approximately 2.29.

Limiting Shapes for Deterministic Centrally Seeded Growth Models

Abstract We study the rotor router model and two deterministic sandpile models. For the rotor router model in ℤd, Levine and Peres proved that the limiting shape of the growth cluster is a sphere.…

References

SHOWING 1-10 OF 20 REFERENCES

The Rotor-Router Model

Building on earlier work of Diaconis and Fulton (1991) and Lawler, Bramson, and Griffeath (1992), Propp in 2001 defined a deterministic analogue of internal diffusion-limited aggregation. This growth…

Simulating a Random Walk with Constant Error

We analyse Jim Propp's $P$-machine, a simple deterministic process that simulates a random walk on ${\mathbb Z}^d$ to within a constant. The proof of the error bound relies on several estimates in…

Brownian Motion and Harnack Inequality for Schrodinger Operators

  • M.
  • Mathematics
1. Introduction In this paper we shall discuss solutions of the time independent Schrodinger equation Since V will not be required to go to zero at infinity, one can obtain results on solutions of Hu…

Symmetrization Inequalities for Difference Equations on Graphs

We prove symmetrization inequalities for positive solutions of (not necessarily linear) difference equations of the form??u=?u?c·u+?,where ? is a discrete Laplacian, ? is a convex decreasing…

A general rearrangement inequality for multiple integrals

Abstract In this paper we prove a rearrangement inequality that generalizes inequalities given in the book by Hardy, Littlewood and Polya1 and by Luttinger and Friedberg.2 The inequality for an…

Goldbug variations

This column is a place for those bits of contagious mathematics that travel from person to person in the community, because they are so elegant, suprising, or appealing that one has an urge to pass…

An approximation of partial sums of independent RV'-s, and the sample DF. I

SummaryLet Sn=X1+X2+⋯+Xnbe the sum of i.i.d.r.v.-s, EX1=0, EX12=1, and let Tn= Y1+Y2+⋯+Ynbe the sum of independent standard normal variables. Strassen proved in [14] that if X1 has a finite fourth…

The Growth Model

The economy consists of three sectors. A competitive R&D sector where new ideas are produced, a monopolistic intermediate good sector, where the incumbent monopolist supplies the latest generation of…

Subdiffusive Fluctuations for Internal Diffusion Limited Aggregation

Internal diffusion limited aggregation (internal DLA) is a cluster model in Z d where new points are added by starting random walkers at the origin and letting them run until they have found a new…

Internal Diffusion Limited Aggregation