English
Related papers

Related papers: The shape theorem for the frog model with random i…

200 papers

We prove a law of large numbers for certain random walks on certain attractive dynamic random environments when initialised from all sites equal to the same state. This result applies to random walks on $\mathbb{Z}^d$ with $d\geq1$. We…

Probability · Mathematics 2018-01-11 Stein Andreas Bethuelsen , Markus Heydenreich

A particle subject to successive, random displacements is said to execute a random walk (in position or some other coordinate). The mathematical properties of random walks have been very thoroughly investigated, and the model is used in…

Statistical Mechanics · Physics 2007-05-23 M. Wilkinson , B. Mehlig

We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…

Probability · Mathematics 2015-09-08 Noam Berger , Ron Rosenthal

We investigate collective phenomena with rotationally driven spinners of concave shape. Each spinner experiences a constant internal torque in either a clockwise or counterclockwise direction. Although the spinners are modeled as hard,…

Soft Condensed Matter · Physics 2014-03-10 Nguyen H. P. Nguyen , Daphne Klotsa , Michael Engel , Sharon C. Glotzer

The aim of this work is to demonstrate that the continuous-time frog model can spread arbitrary fast. The set of sites visited by an active particle can become infinite in a finite time.

Probability · Mathematics 2021-08-31 Viktor Bezborodov , Luca Di Persio , Tyll Krueger

We consider Activated Random Walk (ARW), a model which generalizes the Stochastic Sandpile, one of the canonical examples of self organized criticality. Informally ARW is a particle system on $\mathbb{Z}$ with mass conservation. One starts…

Probability · Mathematics 2017-12-05 Riddhipratim Basu , Shirshendu Ganguly , Christopher Hoffman

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…

Probability · Mathematics 2026-04-08 Antal A. Járai , Christian Mönch , Lorenzo Taggi

Place an active particle at the root of a $d$-ary tree and a single dormant particle at each non-root site. In discrete time, active particles move towards the root with probability $p$ and, otherwise, away from the root to a uniformly…

Probability · Mathematics 2023-03-29 Emma Bailey , Matthew Junge , Jiaqi Liu

We consider a stochastic aggregation model on Z^d. Start with particles located at the vertices of the lattice, initially distributed according to the product Bernoulli measure with parameter \mu. In addition, there is an aggregate, which…

Probability · Mathematics 2019-04-22 Vladas Sidoravicius , Alexandre Stauffer

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Probability · Mathematics 2022-09-30 Ercan Sönmez , Arnaud Rousselle

A spider consists of several, say $N$, particles. Particles can jump independently according to a random walk if the movement does not violate some given restriction rules. If the movement violates a rule it is not carried out. We consider…

Probability · Mathematics 2015-03-13 Christophe Gallesco , Sebastian Muller , Serguei Popov , Marina Vachkovskaia

We study a $d$-dimensional branching random walk (BRW) in an i.i.d. random environment on $\mathbb{Z}^d$ in discrete time. A Bernoulli trap field is attached to $\mathbb{Z}^d$, where each site, independently of the others, is a trap with a…

Probability · Mathematics 2026-01-12 Mehmet Öz

Consider a growing system of random walks on the 3,2-alternating tree, where generations of nodes alternate between having two and three children. Any time a particle lands on a node which has not been visited previously, a new particle is…

Probability · Mathematics 2017-07-14 Josh Rosenberg

We study an interacting random walk system on Z where at time 0 there is an active particle at 0 and one inactive particle on each site $n \ge 1$. Particles become active when hit by another active particle. Once activated, the particle…

Probability · Mathematics 2012-12-20 Daniela Bertacchi , Fabio Prates Machado , Fabio Zucca

We show that the critical density of the Activated Random Walk model on $\mathbb{Z}^d$ is strictly less than one when the sleep rate $\lambda$ is small enough, and tends to $0$ when $\lambda\to 0$, in any dimension $d\geqslant 1$. As far as…

Probability · Mathematics 2024-09-04 Nicolas Forien , Alexandre Gaudillière

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

Probability · Mathematics 2007-05-23 Francis Comets , Serguei Popov

* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…

Probability · Mathematics 2011-03-15 Leonardo T. Rolla

The Random First Order Transition Theory (RFOT) predicts that transport proceeds by cooperative movement of particles in domains whose sizes increase as a liquid is compressed above a characteristic volume fraction, $\phi_d$. The rounded…

Soft Condensed Matter · Physics 2024-12-24 Rajsekhar Das , T. R. Kirkpatrick , D. Thirumalai

We introduce and study a class of random walks defined on the integer lattice $ \mathbb{Z} ^d$ -- a discrete space and time counterpart of the symmetric $\alpha$-stable process in $\mathbb{R} ^d$. When $0< \alpha <2$ any coordinate axis in…

Probability · Mathematics 2016-02-15 Alexander Bendikov , Wojciech Cygan

We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…

Systems and Control · Computer Science 2019-01-11 Andrew Clark , Basel Alomair , Linda Bushnell , Radha Poovendran