English
Related papers

Related papers: Collisions of several walkers in recurrent random …

200 papers

Random walkers characterized by random positions and random velocities lead to normal diffusion. A random walk was originally proposed by Einstein to model Brownian motion and to demonstrate the existence of atoms and molecules. Such a…

Statistical Mechanics · Physics 2018-08-01 Daniel Escaff , Raul Toral , Christian Van den Broeck , Katja Lindenberg

We construct a two-dimensional counterexample of a random walk in random environment (RWRE). The environment is stationary, mixing and perturbative, and the corresponding RWRE has non-trivial probability to wander off to the upper right.…

Probability · Mathematics 2012-03-15 Hadrian Heil

A recurrent graph $G$ has the infinite collision property if two independent random walks on $G$, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this…

Probability · Mathematics 2010-03-18 Martin T. Barlow , Yuval Peres , Perla Sousi

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 winding behavior of random walks on two oriented square lattices. One common feature of these walks is that they are bound to revolve clockwise. We also obtain quantitative results of transience/recurrence for each walk.

Probability · Mathematics 2022-05-16 Gianluca Bosi , Yiping Hu , Yuval Peres

We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on point processes and…

Probability · Mathematics 2015-06-03 Arnaud Rousselle

On an $r\times (n-r)$ lattice rectangle, we first consider walks that begin at the SW corner, proceed with unit steps in either of the directions E or N, and terminate at the NE corner of the rectangle. For each integer $k$ we ask for…

Combinatorics · Mathematics 2016-09-06 Ira Gessel , Wayne Goddard , Walter Shur , Herbert S. Wilf , Lily Yen

Let $\mathcal{U}$ be the uniform spanning tree on $\mathbb{Z}^3$, whose probability law is denoted by $\mathbf{P}$. For $\mathbf{P}$-a.s. realization of $\mathcal{U}$, the recurrence of the the simple random walk on $\mathcal{U}$ is proved…

Probability · Mathematics 2023-02-13 Satomi Watanabe

Random Walks in Dirichlet Environment (RWDE) correspond to Random Walks in Random Environment (RWRE) on $\Bbb{Z}^d$ where the transition probabilities are i.i.d. at each site with a Dirichlet distribution. Hence, the model is parametrized…

Probability · Mathematics 2016-02-01 Christophe Sabot , Laurent Tournier

We consider a left-transient random walk in a random environment on Z that will be disturbed by cookies inducing a drift to the right of strength 1. The number of cookies per site is i.i.d. and independent of the environment. Criteria for…

Probability · Mathematics 2011-10-28 Elisabeth Bauernschubert

We study a generalisation of the one-dimensional Rademacher random walk introduced in Bhattacharya and Volkov (2023) to $\mathbb{Z}^2$ (for $d\ge 3$, the Rademacher random walk is always transient, as follows from Theorem 8.8 in Englander…

Probability · Mathematics 2026-02-16 Satyaki Bhattacharya , Stanislav Volkov

We study a discrete-time quantum walk in presence of a detector at $x_D$ initially. The detector here is repeatedly removed after a span of $t_R$, the removal time, and reinserted at random locations. Two relocation rules are considered…

Quantum Physics · Physics 2026-04-07 Md Aquib Molla , Sanchari Goswami

We study the frog model on $\mathbb{Z}^d$ with drift in dimension $d \geq 2$ and establish the existence of transient and recurrent regimes depending on the transition probabilities. We focus on a model in which the particles perform…

Probability · Mathematics 2021-04-27 Christian Döbler , Nina Gantert , Thomas Höfelsauer , Serguei Popov , Felizitas Weidner

This thesis examines edge-reinforced random walks with some modifications to the standard definition. An overview of known results relating to the standard model is given and the proof of recurrence for the standard linearly edge-reinforced…

Probability · Mathematics 2023-09-07 Fabian Michel

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

Famously, a $d$-dimensional, spatially homogeneous random walk whose increments are non-degenerate, have finite second moments, and have zero mean is recurrent if $d \in \{1,2\}$ but transient if $d \geq 3$. Once spatial homogeneity is…

Probability · Mathematics 2017-01-06 Nicholas Georgiou , Mikhail V. Menshikov , Aleksandar Mijatović , Andrew R. Wade

We study the dynamics of random walks hopping on homogeneous hyper-cubic lattices and multiplying at a fertile site. In one and two dimensions, the total number $\mathcal{N}(t)$ of walkers grows exponentially at a Malthusian rate depending…

Statistical Mechanics · Physics 2021-02-17 Michel Bauer , P. L. Krapivsky , Kirone Mallick

We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…

Statistical Mechanics · Physics 2017-08-18 A. V. Nazarenko , V. Blavatska

We prove that random walks in random environments, that are exponentially mixing in space and time, are almost surely diffusive, in the sense that their scaling limit is given by the Wiener measure.

Mathematical Physics · Physics 2009-11-13 Jean Bricmont , Antti Kupiainen

It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.

Probability · Mathematics 2008-08-05 Itai Benjamini , Ori Gurel-Gurevich