English
Related papers

Related papers: Mean-field limit for activated random walk on the …

200 papers

In this paper we investigate the scaling limit of the range (the set of visited vertices) for a class of critical lattice models, starting from a single initial particle at the origin. We give conditions on the random sets and an associated…

Probability · Mathematics 2018-06-25 Mark Holmes , Edwin Perkins

Suppose that $X$ is a simple random walk on $\Z_n^d$ for $d \geq 3$ and, for each $t$, we let $\U(t)$ consist of those $x \in \Z_n^d$ which have not been visited by $X$ by time $t$. Let $\tcov$ be the expected amount of time that it takes…

Probability · Mathematics 2013-09-13 Jason Miller , Perla Sousi

In this paper, we show that reflecting Brownian motion in any bounded domain D can be approximated, as $k\to\infty$, by simple random walks on "maximal connected" subsets of $(2^{-k}\mathbb{Z}^d)\cap D$ whose filled-in interiors are inside…

Probability · Mathematics 2013-07-26 Krzysztof Burdzy , Zhen-Qing Chen

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

Probability · Mathematics 2021-12-08 David A. Croydon , Daisuke Shiraishi

We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks on the simplex of probability measures over a finite set. Due to a reinforcement mechanism, the increments of the walks are…

Probability · Mathematics 2016-06-09 Irene Crimaldi , Paolo Dai Pra , Pierre-Yves Louis , Ida Germana Minelli

We consider a weighted lattice $Z^d$ with conductance $\mu_e=|e|^{-\alpha}$. We show that the heat kernel of a variable speed random walk on it satisfies a two-sided Gaussian bound by using an intrinsic metric. We also show that when $d=2$…

Probability · Mathematics 2015-10-02 Xinxing Chen

We prove a quenched central limit theorem for random walks with bounded increments in a randomly evolving environment on $\mathbb{Z}^d$. We assume that the transition probabilities of the walk depend not too strongly on the environment and…

Probability · Mathematics 2009-09-29 Dmitry Dolgopyat , Gerhard Keller , Carlangelo Liverani

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…

Probability · Mathematics 2010-02-10 Fabienne Castell , Nadine Guillotin-Plantard , Françoise Pène , Bruno Schapira

We consider Activated Random Walks on $\Z$ with totally asymmetric jumps and critical particle density, with different time scales for the progressive release of particles and the dissipation dynamics. We show that the cumulative flow of…

Probability · Mathematics 2020-08-14 Manuel Cabezas , Leonardo T. Rolla

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

We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…

We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…

Statistical Mechanics · Physics 2021-06-30 Feng Huang , Hanshuang Chen

We consider the simple random walk on the infinite cluster of a general class of percolation models on $\mathbb{Z}^d$, $d\geq 3$, including Bernoulli percolation as well as models with strong, algebraically decaying correlations. For almost…

Probability · Mathematics 2026-02-25 Alberto Chiarini , Zhizhou Liu , Maximilian Nitzschner

Motivated by the dissipative abelian sandpile model, we analyze the trajectories of a one-dimensional random walk in a landscape of soft traps. These traps, placed at increasing distances from each other, correspond to dissipative sites in…

Mathematical Physics · Physics 2025-07-09 Frank Redig , Ellen Saada , Berend van Tol

The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…

Data Structures and Algorithms · Computer Science 2010-07-20 John Alexandris , Gregory Karagiorgos 'and' Ioannis Stavrakakis

We study a one-dimensional lattice random walk with an absorbing boundary at the origin and a movable partial reflector. On encountering the reflector, at site x, the walker is reflected (with probability r) to x-1 and the reflector is…

Statistical Mechanics · Physics 2009-11-07 Ronald Dickman , Daniel ben-Avraham

Let $\{Z_n\}_{n\geq 0 }$ be a critical $d$-dimensional branching random walk started from a Poisson random measure whose intensity measure is the Lebesgue measure on $\mathbb{R}^d$. Denote by…

Probability · Mathematics 2026-01-28 Shuxiong Zhang

We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…

Probability · Mathematics 2007-05-23 Martin T. Barlow

We prove a weak law of large numbers for the capacity of the range of simple random walks on $\mathbb{Z}^{4}$. On $\mathbb{Z}^{3}$, we show that the capacity, properly scaled, converges in distribution towards the corresponding quantity for…

Probability · Mathematics 2016-11-29 Yinshan Chang

We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…

Statistical Mechanics · Physics 2007-05-23 Jae Dong Noh , Heiko Rieger