English
Related papers

Related papers: A stochastic combustion model with thresholds on t…

200 papers

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 present a general stochastic forest-fire model which shows a variety of different structures depending on the parameter values. The model contains three possible states per site (tree, burning tree, empty site) and three parameters (tree…

Condensed Matter · Physics 2009-10-22 B. Drossel , F. Schwabl

We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root. We first use stochastic geometry arguments…

Probability · Mathematics 2007-05-23 Francois Baccelli , Charles Bordenave

In this paper, we introduce a one-dimensional model of particles performing independent random walks, where only pairs of particles can produce offspring ("cooperative branching"), and particles that land on an occupied site merge with the…

Probability · Mathematics 2015-05-29 Anja Sturm , Jan M. Swart

We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both types diffuse as simple random walks with possibly…

Probability · Mathematics 2025-11-04 Sungwon Ahn , Matthew Junge , Hanbaek Lyu , Lily Reeves , Jacob Richey , David Sivakoff

We consider the hierarchic tree Random Energy Model with continuous branching and calculate the moments of the corresponding partition function. We establish the multifractal properties of those moments. We derive formulas for the normal…

Statistical Mechanics · Physics 2015-06-12 David B. Saakian

Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…

Probability · Mathematics 2008-04-26 Jozsef Balogh , Yuval Peres , Gabor Pete

This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…

Probability · Mathematics 2020-06-01 Julia Gaudio , Yury Polyanskiy

We consider an exhaustive polling system with three nodes in its transient regime under a switching rule of generalized greedy type. We show that, for the system with Poisson arrivals and service times with finite second moment, the…

Probability · Mathematics 2007-05-23 I. M. MacPhee , M. V. Menshikov , S. Popov , S. Volkov

We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…

Probability · Mathematics 2025-02-06 Giulio Iacobelli , Guilherme Ost , Daniel Y. Takahashi

The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…

Statistical Mechanics · Physics 2009-11-11 L. Pal

We study an ideal-gas-like model where the particles exchange energy stochastically, through energy conserving scattering processes, which take place if and only if at least one of the two particles has energy below a certain energy…

Statistical Mechanics · Physics 2015-05-27 Asim Ghosh , Urna Basu , Anirban Chakraborti , Bikas K. Chakrabarti

We consider random partitions of the vertex set of a given finite graph that can be sampled by means of loop-erased random walks stopped at a random exponential time of parameter $q>0$. The related random blocks tend to cluster nodes…

Probability · Mathematics 2023-01-25 Luca Avena , Jannetje Driessen , Twan Koperberg

We study analytically the late time statistics of the number of particles in a growing tree model introduced by Aldous and Shields. In this model, a cluster grows in continuous time on a binary Cayley tree, starting from the root, by…

Statistical Mechanics · Physics 2009-11-11 David S. Dean , Satya N. Majumdar

Consider a uniform rooted Cayley tree $T_{n}$ with $n$ vertices and let $m$ cars arrive sequentially, independently, and uniformly on its vertices. Each car tries to park on its arrival node, and if the spot is already occupied, it drives…

Probability · Mathematics 2021-07-06 Alice Contat , Nicolas Curien

We study the random transverse field Ising model on a finite Cayley tree. This enables us to probe key questions arising in other important disordered quantum systems, in particular the Anderson transition and the problem of dirty bosons on…

Disordered Systems and Neural Networks · Physics 2023-12-18 Ankita Chakrabarti , Cyril Martins , Nicolas Laflorencie , Bertrand Georgeot , Éric Brunet , Gabriel Lemarié

The frog model is a system of interacting random walks. Initially, there is one particle at each vertex of a connected graph $\mathcal{G}$. All particles are inactive at time zero, except for the one which is placed at the root of…

Probability · Mathematics 2022-10-12 Gustavo O. de Carvalho , Fábio P. Machado

Cyclic transitions between active and passive states are central to many natural and synthetic systems, ranging from light-driven active particles to animal migrations. Here, we investigate a minimal model of self-propelled Brownian…

Soft Condensed Matter · Physics 2025-01-28 Ye Zhang , Duanduan Wan

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

We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…

Physics and Society · Physics 2018-11-28 Julien Petit , Martin Gueuning , Timoteo Carletti , Ben Lauwens , Renaud Lambiotte