English
Related papers

Related papers: A random walk on Z with drift driven by its occupa…

200 papers

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 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 introduce random walks in a sparse random environment on $\mathbb Z$ and investigate basic asymptotic properties of this model, such as recurrence-transience, asymptotic speed, and limit theorems in both the transient and recurrent…

Probability · Mathematics 2016-12-01 Anastasios Matzavinos , Alexander Roitershtein , Youngsoo Seol

Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…

Probability · Mathematics 2018-08-17 Tianyao Chen , Xue Cheng , Jingping Yang

The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…

Probability · Mathematics 2010-04-08 Alexander E. Holroyd , James Propp

The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of…

Probability · Mathematics 2013-09-26 János Pach , Gábor Tardos

In this article we consider a natural class of random walks on free products of graphs, which arise as convex combinations of random walks on the single factors. From the works of Gilch [6,7] it is well-known that for these random walks the…

Probability · Mathematics 2025-10-21 Lorenz A. Gilch

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 study the asymptotic behavior of the simple random walk on oriented version of $\mathbb{Z}^2$. The considered latticesare not directed on the vertical axis but unidirectional on the horizontal one, with symmetric random orientations…

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

This investigation is motivated by a result we proved recently for the random transposition random walk: the distance from the starting point of the walk has a phase transition from a linear regime to a sublinear regime at time $n/2$. Here,…

Probability · Mathematics 2007-05-23 Nathanael Berestycki , Rick Durrett

We study the asymptotic distribution of random walks on $\mathbb Z^d$ ($d\ge1$) in deterministic reversible environments defined by an assignment of a positive conductance to each edge of $\mathbb Z^d$. We identify a deterministic set of…

Probability · Mathematics 2025-12-03 Marek Biskup

We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…

Probability · Mathematics 2014-04-28 Ostap Hryniv , Mikhail V. Menshikov , Andrew R. Wade

We consider biased random walks on random networks constituted by a random comb comprising a backbone with quenched-disordered random-length branches. The backbone and the branches run in the direction of the bias. For the bare model as…

Statistical Mechanics · Physics 2025-06-09 Mrinal Sarkar , Shamik Gupta

Consider a nearest neighbor random walk on the two-dimensional integer lattice, where each vertex is initially labeled either `H' or `V', uniformly and independently. At each discrete time step, the walker resamples the label at its current…

Probability · Mathematics 2023-05-11 Swee Hong Chan

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 consider a random walk in dimension $d\geq 1$ in a dynamic random environment evolving as an interchange process with rate $\gamma>0$. We only assume that the annealed drift is non-zero. We prove that the empirical velocity of the walker…

Probability · Mathematics 2018-04-18 M. Salvi , F. Simenhaus

We consider random walks in a random environment that is given by i.i.d. Dirichlet distributions at each vertex of Z^d or, equivalently, oriented edge reinforced random walks on Z^d. The parameters of the distribution are a 2d-uplet of…

Probability · Mathematics 2013-09-20 Christophe Sabot , Laurent Tournier

The range, local times, and periodicity of symmetric, weakly asymmetric and asymmetric random walks at the time of exit from a strip with $N$ locations are considered. Several results on asymptotic distributions are obtained.

Probability · Mathematics 2010-09-22 Siva Athreya , Sunder Sethuraman , Balint Toth

The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…

Statistical Mechanics · Physics 2022-11-23 E. Ben-Naim , P. L. Krapivsky

We prove a quenched invariance principle for a class of random walks in random environment on $\mathbb{Z}^d$, where the walker alters its own environment. The environment consists of an outgoing edge from each vertex. The walker updates the…

Probability · Mathematics 2021-07-02 Swee Hong Chan , Lila Greco , Lionel Levine , Peter Li
‹ Prev 1 4 5 6 7 8 10 Next ›