Related papers: Rotor-router aggregation on the layered square lat…
We study the rotor-router walk with the clockwise ordering of outgoing edges on the semi-infinite cylinder. Imposing uniform conditions on the boundary of the cylinder, we consider growth of the cluster of visited sites and its internal…
We study the scaling limits of three different aggregation models on the integer lattice Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform…
We prove a shape theorem for rotor-router aggregation on the comb, for a specific initial rotor configuration and clockwise rotor sequence for all vertices. Furthermore, as an application of rotor-router walks, we describe the harmonic…
Rotor walk is deterministic counterpart of random walk on graphs. We study that under a certain initial configuration in Z^d, n particles perform rotor walks from the origin consecutively. They would stop if they hit the origin or infinity.…
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 show that the set of occupied sites for this model on an infinite regular tree is a…
We study the rotor router model and two deterministic sandpile models. For the rotor router model in $\mathbb{Z}^d$, Levine and Peres proved that the limiting shape of the growth cluster is a sphere. For the other two models, only bounds in…
In the Diffusion Limited Aggregation (DLA) process on on $\mathbb{Z}^2$, or more generally $\mathbb{Z}^d$, particles aggregate to an initially occupied origin by arrivals on a random walk. The scaling limit of the result, empirically, is a…
We study a rotor-router version of the internal diffusion-limited aggregation introduced by J.Propp. The existing estimations of boundary fluctuations of the aggregation cluster show that they grow not faster than $O(\log r)$ with the…
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we…
Internal diffusion-limited aggregation is a growth model based on random walk in Z^d. We study how the shape of the aggregate depends on the law of the underlying walk, focusing on a family of walks in Z^2 for which the limiting shape is a…
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a…
We study the growing patterns in the rotor-router model formed by adding $N$ walkers at the center of a $L \times L$ two-dimensional square lattice, starting with a periodic background of arrows, and relaxing to a stable configuration. The…
Rotating clusters or vortices are formations of agents that rotate around a common center. These patterns may be found in very different contexts: from swirling fish to surveillance drones. Here, we propose a minimal model for…
The two-dimensional comb lattice $C_2$ is a natural spanning tree of the Euclidean lattice $\mathbb{Z}^2$. We study three related cluster growth models on $C_2$: internal diffusion limited aggregation (IDLA), in which random walkers move on…
We study the fractal structure of Diffusion-Limited Aggregation (DLA) clusters on the square lattice by extensive numerical simulations (with clusters having up to $10^8$ particles). We observe that DLA clusters undergo strongly anisotropic…
Evolution of mixing of granular solids in a slowly rotated 2D drum is considered as a discrete mapping. The rotation is around the axis of the upright drum which is filled partially, and the mixing occurs only at a free surface of a…
Ensembles of particles rotating in a two-dimensional fluid can exhibit chaotic dynamics yet develop signatures of hidden order. Such "rotors" are found in the natural world spanning vastly disparate length scales - from the rotor proteins…
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 [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors…
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 following property: if at some moment of time,…
The scaling behavior of the closed trajectories of a moving particle generated by randomly placed rotators or mirrors on a square or triangular lattice is studied numerically. For most concentrations of the scatterers the trajectories close…