Rotor-router aggregation on the layered square lattice

MaRDI QIDQ612935zbMATH OpenFDO

Authors Wouter Kager, Lionel Levine

Publication date 16 December 2010

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

Full work available at URL https://arxiv.org/abs/1003.4017, https://eudml.org/doc/225388, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r152.html

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

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)

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.

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

Cited in

(9)

• Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile
• Algorithmic aspects of rotor-routing and the notion of linear equivalence
• Proportionate growth in patterns formed in the rotor-router model
• Perfect boundaries in rotor-router aggregation on cylinders
• Divisible sandpile on Sierpinski gasket graphs
• The range of a rotor walk
• Spherical asymptotics for the rotor-router model in $\mathbb{Z}^d$
• Rotor-router aggregation on the comb
• Abelian networks. I: Foundations and examples

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)