English
Related papers

Related papers: Rotor-router aggregation on the layered square lat…

200 papers

We study the scaling limits of three different aggregation models on Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform deterministic analogues of…

Probability · Mathematics 2010-12-24 Lionel Levine , Yuval Peres

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…

Probability · Mathematics 2010-10-11 Lionel Levine , Yuval Peres

A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is…

Probability · Mathematics 2015-06-22 Wilfried Huss , Sebastian Mueller , Ecaterina Sava-Huss

The rotor-router model is a popular deterministic analogue of random walk. In this paper we prove that all orbits of the rotor-router operation have the same size on a strongly connected directed graph (digraph) and give a formula for the…

Combinatorics · Mathematics 2015-07-21 Trung Van Pham

We explore thick accretion disks around rotating attractors. We detail the configurations analysing the fluid angular momentum and finally providing a characterization of the disk morphology and different possible topologies. Investigating…

High Energy Astrophysical Phenomena · Physics 2015-06-23 D. Pugliese , G. Montani

The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this "deterministic random walk" covers all…

Discrete Mathematics · Computer Science 2010-06-18 Tobias Friedrich , Thomas Sauerwald

We study a simple swarming model on a two-dimensional lattice where the self-propelled particles exhibit a tendency to align ferromagnetically. Volume exclusion effects are present: particles can only hop to a neighboring node if the node…

Biological Physics · Physics 2013-02-18 Fernando Peruani , Tobias Klauss , Andreas Deutsch , Anja Voss-Boehme

We study internal diffusion limited aggregation on $\mathbb{Z}$, where a cluster is grown incrementally by adding, for each random walk dispatched from the origin, the first site it reaches outside the cluster. We assume that the increment…

Probability · Mathematics 2026-03-11 Conrado da Costa , Debleena Thacker , Andrew Wade

We study ballistic aggregation on a two dimensional square lattice, where particles move ballistically in between momentum and mass conserving coalescing collisions. Three models are studied based on the shapes of the aggregates: in the…

Statistical Mechanics · Physics 2023-10-20 Fahad Puthalath , Apurba Biswas , V. V. Prasad , R. Rajesh

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 a Euclidean ball, in a sense which is…

Probability · Mathematics 2009-12-05 Lionel Levine , Yuval Peres

Diffusion-limited aggregation (DLA) assumes that particles perform pure random walk at a finite temperature and aggregate when they come close enough and stick together. Although it is well known that DLA in two dimensions results in a…

Statistical Mechanics · Physics 2013-09-02 Li Deng , Yanting Wang , Zhong-Can Ou-Yang

We study the evolution of an initially random distribution of particles on a square lattice, under certain rules for `growing' and `culling' of particles. In one version we allow the particles to move laterally along the surface (mobile…

Soft Condensed Matter · Physics 2009-11-07 Tapati Dutta , Nikolai Lebovka , S. Tarafdar

In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…

Probability · Mathematics 2018-06-12 Irina Cristali , Matthew Junge , Rick Durrett

The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational…

Discrete Mathematics · Computer Science 2015-08-12 Takeharu Shiraga , Yukiko Yamauchi , Shuji Kijima , Masafumi Yamashita

Particle rafts floating at an air-liquid interface exhibit a variety of behaviors when interfacial flow is introduced. Motivated by previous experimental observations, the failure pattern of particle rafts under uniform radial expansion is…

Soft Condensed Matter · Physics 2023-08-16 Khá-Î Tô

For a class of aggregation models on the integer lattice $\mathbb{Z}^d$, $d\geq 2$, in which clusters are formed by particles arriving one after the other and sticking irreversibly where they first hit the cluster, including the classical…

Probability · Mathematics 2023-08-28 Tillmann Bosch , Steffen Winter

We consider a one-parameter family of invertible maps of a two-dimensional lattice, obtained by applying round-off to planar rotations. All orbits of these maps are conjectured to be periodic. We let the angle of rotation approach pi/2, and…

Dynamical Systems · Mathematics 2014-06-02 Heather Reeve-Black

Two-dimensional cluster-cluster aggregation is studied when clusters move both diffusively and sediment with a size dependent velocity. Sedimentation breaks the rotational symmetry and the ensuing clusters are not self-similar fractals: the…

Statistical Mechanics · Physics 2007-05-23 M. Peltomaki , E. K. O. Hellen , M. J. Alava

We consider a cluster growth model on Z^d, called internal diffusion limited aggregation (internal DLA). In this model, random walks start at the origin, one at a time, and stop moving when reaching a site not occupied by previous walks. It…

Probability · Mathematics 2010-05-31 Amine Asselah , Alexandre Gaudilliere

A swarm of anonymous oblivious mobile robots, operating in deterministic Look-Compute-Move cycles, is confined within a circular track. All robots agree on the clockwise direction (chirality), they are activated by an adversarial…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-11-19 Giuseppe A. Di Luna , Ryuhei Uehara , Giovanni Viglietta , Yukiko Yamauchi