English
Related papers

Related papers: Slow movement of random walk in random environment…

200 papers

We consider the limit behavior of a one-dimensional random walk with unit jumps whose transition probabilities are modified every time the walk hits zero. The invariance principle is proved in the scheme of series where the size of…

Probability · Mathematics 2016-11-08 Andrey Pilipenko , Vladislav Khomenko

The simple random walk on $\mathbb{Z}^p$ shows two drastically different behaviours depending on the value of $p$: it is recurrent when $p\in\{1,2\}$ while it escapes (with a rate increasing with $p$) as soon as $p\geq3$. This classical…

Data Structures and Algorithms · Computer Science 2023-08-22 Farah Ben Naoum , Christophe Godin , Romain Azaïs

We characterize ballistic behavior for general i.i.d. random walks in random environments on $\mathbb{Z}$ with bounded jumps. The two characterizations we provide do not use uniform ellipticity conditions. They are natural in the sense that…

Probability · Mathematics 2022-05-16 Daniel J. Slonim

For a random walk in an elliptic i.i.d. random environment in dimension greater than or equal to 4, satisfying the a ballisticity condition slightly weaker than condition (T'), We consider the probability of linear slowdown. We show an…

Probability · Mathematics 2012-07-05 Noam Berger

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

Probability · Mathematics 2012-10-24 David A. Croydon

We consider the tree-reduced path of symmetric random walk on $\ZZ^{d}$. It is interesting to ask about the number of turns $T_n$ in the reduced path after $n$ steps. This question arises from inverting signature for lattice paths. We show…

Probability · Mathematics 2011-09-27 Yunjiang Jiang , Weijun Xu

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

We consider a transient random walk $(X_n)$ in random environment on a Galton--Watson tree. Under fairly general assumptions, we give a sharp and explicit criterion for the asymptotic speed to be positive. As a consequence, situations with…

Probability · Mathematics 2011-01-11 Elie Aidekon

We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…

Probability · Mathematics 2016-05-02 A. D. Barbour , A. Collevecchio

We study the Ergodic Properties of Random Walks in stationary ergodic environments without uniform ellipticity under a minimal assumption. There are two main components in our work. The first step is to adopt the arguments of Lawler to…

Probability · Mathematics 2026-02-03 Ayan Ghosh

We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…

Probability · Mathematics 2015-09-15 Peggy Cénac , Basile De Loynes , Arnaud Le Ny , Yoann Offret

We study a random walk driven by a particle system from a generic class, and establish a law of large numbers for the walk for almost all densities of the environment. To do so, we exploit the finite-ranged approximations of the environment…

Probability · Mathematics 2026-05-27 Guillaume Conchon--Kerjan , Toril Palaniappan

We study the mean first passage time of a one-dimensional random walker with step sizes decaying exponentially in discrete time. That is step sizes go like $\lambda^{n}$ with $\lambda\leq1$ . We also present, for pedagogical purposes, a…

Statistical Mechanics · Physics 2009-11-10 Tonguç Rador , Sencer Taneri

We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…

Probability · Mathematics 2020-01-28 Siva Athreya , Antar Bandyopadhyay , Amites Dasgupta , Neeraja Sahasrabudhe

We consider a minimal model of one-dimensional discrete-time random walk with step-reinforcement, introduced by Harbola, Kumar, and Lindenberg (2014): The walker can move forward (never backward), or remain at rest. For each $n=1,2,\cdots$,…

Probability · Mathematics 2020-07-13 Tatsuya Miyazaki , Masato Takei

We present a procedure that determines the law of a random walk in an iid random environment as a function of a single "typical" trajectory. We indicate when the trajectory characterizes the law of the environment, and we say how this law…

Probability · Mathematics 2007-05-23 Omer Adelman , Nathanaël Enriquez

Let $\{S_n,n\geq 0\} $ be a random walk whose increments belong without centering to the domain of attraction of an $\alpha$-stable law $\{Y_t,t\geq 0\}$, i.e. $S_{nt}/a_n\Rightarrow Y_t,t\geq 0,$ for some scaling constants $a_n$. Assuming…

Probability · Mathematics 2023-03-15 Congzao Dong , Elena Dyakonova , Vladimir Vatutin

We study the densities of uniform random walks in the plane. A special focus is on the case of short walks with three or four steps and less completely those with five steps. As one of the main results, we obtain a hypergeometric…

Classical Analysis and ODEs · Mathematics 2015-03-19 Jonathan M. Borwein , Armin Straub , James Wan , Wadim Zudilin

We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties for the environment as seen from the position of the walker,…

Probability · Mathematics 2013-10-04 Frank Redig , Florian Völlering

One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…

Statistical Mechanics · Physics 2016-03-23 Rüdiger Kürsten
‹ Prev 1 3 4 5 6 7 10 Next ›