English
Related papers

Related papers: Dissipative Abelian Sandpiles and Random Walks

200 papers

We consider a random walk of $n$ steps starting at $x_0=0$ with a double exponential (Laplace) jump distribution. We compute exactly the distribution $p_{k,n}(\Delta)$ of the gap $d_{k,n}$ between the $k^{\rm th}$ and $(k+1)^{\rm th}$…

Statistical Mechanics · Physics 2019-09-09 Bertrand Lacroix-A-Chez-Toine , Satya N. Majumdar , Grégory Schehr

In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…

Probability · Mathematics 2022-08-02 Eleanor Archer

Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…

Statistical Mechanics · Physics 2015-03-24 Gerard Le Caer

We consider the branching random walk on the real line where the underlying motion is of a simple random walk and branching is at least binary and at most decaying exponentially in law. It is well known that the normalized empirical measure…

Probability · Mathematics 2012-07-11 Oren Louidor , Will Perkins

We determine the distribution of the sandpile group (also known as the Jacobian) of the Erd\H{o}s-R\'{e}nyi random graph $G(n,q)$ along with its canonical duality pairing as $n$ tends to infinity, fully resolving a conjecture from 2015 due…

Combinatorics · Mathematics 2023-11-14 Eliot Hodges

We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…

Probability · Mathematics 2007-10-12 Francis Comets , Francois Simenhaus

In a landscape composed of N randomly distributed sites in Euclidean space, a walker (``tourist'') goes to the nearest one that has not been visited in the last \tau steps. This procedure leads to trajectories composed of a transient part…

Disordered Systems and Neural Networks · Physics 2010-06-10 O. Kinouchi , A. S. Martinez , G. F. Lima , G. M. Lourenco , S. Risau-Gusman

In the stochastic sandpile model on a graph, particles interact pairwise as follows: if two particles occupy the same vertex, they must each take an independent random walk step with some probability $0<p<1$ of not moving. These…

Probability · Mathematics 2022-04-27 Andrew Melchionna

The purpose of this note is to establish convergence of random walks on the moduli space of Abelian differentials on compact Riemann surfaces in two different modes: convergence of the $n$-step distributions from almost every starting point…

Dynamical Systems · Mathematics 2024-05-02 Roland Prohaska

We demonstrate that continuous time random walks in which successive waiting times are correlated by Gaussian statistics lead to anomalous diffusion with mean squared displacement <r^2(t)>~t^{2/3}. Long-ranged correlations of the waiting…

Statistical Mechanics · Physics 2015-05-14 Vincent Tejedor , Ralf Metzler

We study the dynamics of the Stochastic Sandpile Model on finite graphs, with two main results. First, we describe a procedure to exactly sample from the stationary distribution of the model in all connected finite graphs, extending a…

Probability · Mathematics 2026-02-23 Concetta Campailla , Nicolas Forien

We study the long-time behavior of decoupled continuous-time random walks characterized by superheavy-tailed distributions of waiting times and symmetric heavy-tailed distributions of jump lengths. Our main quantity of interest is the…

Statistical Mechanics · Physics 2011-12-30 S. I. Denisov , S. B. Yuste , Yu. S. Bystrik , H. Kantz , K. Lindenberg

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

Probability · Mathematics 2020-06-19 Leran Cai , Thomas Sauerwald , Luca Zanetti

We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.

Probability · Mathematics 2016-07-27 Endre Csaki , Antonia Foldes , Pal Revesz

An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…

Statistical Mechanics · Physics 2007-05-23 Luis Acedo , Santos B. Yuste

We study random walks evolving in continuous time on a one-dimensional lattice where each site $x$ hosts a quenched random potential $U_x$. The potentials on different sites are independent, identically distributed Gaussian random…

Statistical Mechanics · Physics 2026-02-27 Silvio Kalaj , Enzo Marinari , Gleb Oshanin , Luca Peliti

Self-similar dynamical processes are characterized by a growing length scale $\xi$ which increases with time as $\xi \sim t^{1/z}$, where z is the dynamical exponent. The best known example is a simple random walk with z=2. Usually such…

Statistical Mechanics · Physics 2016-01-18 Lukas Kades , Manuel Schrauth , Maximilian Schneider , Haye Hinrichsen

We compute the correlations of two height variables in the two-dimensional Abelian sandpile model. We extend the known result for two minimal heights to the case when one of the heights is bigger than one. We find that the most dominant…

Statistical Mechanics · Physics 2008-11-26 V. S. Poghosyan , S. Y. Grigorev , V. B. Priezzhev , P. Ruelle

We study random walks on $\mathbb{Z}$ which have a linear (or almost linear) drift towards 0 in a range around 0. This drift leads to a metastable Gaussian distribution centered at zero. We give specific, fast growing, time windows where we…

Probability · Mathematics 2023-07-18 O. S. Awolude , E. Cator , H. Don

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

Data Structures and Algorithms · Computer Science 2015-07-09 Siu On Chan , Tsz Chiu Kwok , Lap Chi Lau