English
Related papers

Related papers: Recurrence of Simple Random Walk on $Z^2$ is Dynam…

200 papers

We study the range $R_n$ of a random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ indexed by a random tree with $n$ vertices. Under the assumption that the random walk is centered and has finite fourth moments, we prove in dimension…

Probability · Mathematics 2015-11-18 Jean-François Le Gall , Shen Lin

We study the asymptotic behavior of the simple random walk on oriented versions of $\mathbb{Z}^2$. The considered lattices are not directed on the vertical axis but unidirectional on the horizontal one, with random orientations whose…

Probability · Mathematics 2007-05-23 Nadine Guillotin-Plantard , Arnaud Le Ny

We consider a special case of random walk in random environment (RWRE) on Z^d where the environment is periodic (RWPE). Under natural conditions, we show that law of large numbers and central limit theorem holds. In the ballistic nearest…

Probability · Mathematics 2010-10-21 Istvan Redl , Balint Veto

We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost surely recurrent. As a corollary, we obtain that the uniform infinite planar triangulation and quadrangulation…

Probability · Mathematics 2012-06-05 Ori Gurel-Gurevich , Asaf Nachmias

We prove a conjecture by Bertoin that the multi-dimensional elephant random walk on $\mathbb{Z}^d$($d\geq 3$) is transient and the expected number of zeros is finite. We also provide some estimates on the rate of escape. In dimensions $d=…

Probability · Mathematics 2025-05-29 Shuo Qin

We consider a random walk X_n in Z_+, starting at X_0=x>= 0, with transition probabilities P(X_{n+1}=X_n+1|X_n=y>=1)=1/2-\delta/(4y+2\delta) P(X_{n+1}=X_n+1|X_n=y>=1)=1/2+\delta/(4y+2\delta) and X_{n+1}=1 whenever X_n=0. We prove that the…

Probability · Mathematics 2009-11-13 Joël De Coninck , François Dunlop , Thierry Huillet

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

Probability · Mathematics 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

In this work, the probability of return for random walks on $\mathbb{Z}$, whose increment is given by the $k$-bonacci sequence, is determined. Also, the Hausorff, packing and box-counting dimensions of the set of these walks that return an…

Probability · Mathematics 2019-12-10 Najmeddine Attia , Chouhaïd Souissi

We consider Sinai's random walk in random environment. We prove that for an interval of time [1,n] Sinai's walk sojourns in a small neighborhood of the point of localization for the quasi totality of this amount of time. Moreover the local…

Probability · Mathematics 2007-05-23 Pierre Andreoletti

Let $(Y_n)$ be a sequence of i.i.d. real valued random variables. Reflected random walk $(X_n)$ is defined recursively by $X_0=x \ge 0$, $X_{n+1} = |X_n - Y_{n+1}|$. In this note, we study recurrence of this process, extending a previous…

Probability · Mathematics 2007-05-23 Marc Peigné , Wolfgang Woess

This paper studies long range random walks on ${\mathbb{Z}_q}^d$. $X_{t+1} = X_t + Z_t \mod q$, with $(Z_t)$ independent and identically distributed. Multiple entries of $Z_t$ can be non-zero in a transition. An emphasis is on finding the…

Probability · Mathematics 2025-10-28 Robert Griffiths , Shuhei Mano

We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…

Probability · Mathematics 2007-05-23 Majid Hosseini , Krishnamurthi Ravishankar

In this article we refine well-known results concerning the fluctuations of one-dimensional random walks. More precisely, if $(S_n)_{n \geq 0}$ is a random walk starting from 0 and $r\geq 0$, we obtain the precise asymptotic behavior as…

Probability · Mathematics 2013-12-06 Rim Essifi , Marc Peigné , Kilian Raschel

The authors propose a new variation of random walks called ladder chains $L(r,s,p)$. We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take $L(2,2,p)$ for instance, we find…

Probability · Mathematics 2018-12-10 Chenhe Zhang , Xiang Fang

In this paper we consider a class of one-dimensional interacting particle systems in equilibrium, constituting a dynamic random environment, together with a nearest-neighbor random walk that on occupied/vacant sites has a local drift to the…

Probability · Mathematics 2009-11-13 L. Avena , F. den Hollander , F. Redig

Let (S_n)_{n\in\N} be a Z-valued random walk with increments from the domain of attraction of some \alpha-stable law and let (\xi(i))_{i\in\Z} be a sequence of iid random variables. We want to investigate U-statistics indexed by the random…

Probability · Mathematics 2015-03-04 Brice Franke , Francoise Pene , Martin Wendler

We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…

Probability · Mathematics 2020-10-28 Marcelo R. Hilário , Daniel Kious , Augusto Teixeira

We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the…

Probability · Mathematics 2014-04-30 Siva Athreya , Antar Bandyopadhyay , Amites Dasgupta

We consider a recurrent random walk in random environment on a regular tree. Under suitable general assumptions upon the distribution of the environment, we show that the walk exhibits an unusual slow movement: the order of magnitude of the…

Probability · Mathematics 2007-05-23 Yueyun Hu , Zhan Shi

We study tree-indexed random walks as introduced by Benjamini, H\"aggstr\"om, and Mossel, i.e. labelings of a tree for which adjacent vertices have labels differing by 1. It is a conjecture of those authors that the distribution of the…

Combinatorics · Mathematics 2019-01-29 Aaron Berger , Caleb Ji , Erik Metz