Rotor-router aggregation on the layered square lattice

zbMATH Open1203.82049arXiv1003.4017MaRDI QIDQ612935FDOQ612935

Authors: Wouter Kager, Lionel Levine 

Publication date: 16 December 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: In rotor-router aggregation on the square lattice Z^2, particles starting at the origin perform deterministic analogues of random walks until reaching an unoccupied site. The limiting shape of the cluster of occupied sites is a disk. We consider a small change to the routing mechanism for sites on the x- and y-axes, resulting in a limiting shape which is a diamond instead of a disk. We show that for a certain choice of initial rotors, the occupied cluster grows as a perfect diamond.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Rotor-router aggregation on the comb
• Perfect boundaries in rotor-router aggregation on cylinders
• Aggregation on a finite lattice
• Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile
• Laplacian roughening model on kagome and honeycomb lattices
• Iterated fully coordinated percolation on a square lattice
• Diffusion limited aggregation on the Boolean lattice
• Bond dimer percolation on square lattices
• Coalescing walks on rotor-router systems
• Recurrent rotor-router configurations

zbMATH Keywords

random walksgrowth modelrouter-router aggregation

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Sums of independent random variables; random walks (60G50) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cited In (8)

• Spherical asymptotics for the rotor-router model in $\mathbb{Z}^d$
• Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile
• The Range of a Rotor Walk
• Rotor-router aggregation on the comb
• Algorithmic aspects of rotor-routing and the notion of linear equivalence
• DIVISIBLE SANDPILE ON SIERPINSKI GASKET GRAPHS
• Abelian networks. I: Foundations and examples
• Perfect boundaries in rotor-router aggregation on cylinders

This page was built for publication: Rotor-router aggregation on the layered square lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612935)