English
Related papers

Related papers: Localization for random walks among random obstacl…

200 papers

We consider Sinai's random walk in random environment $(S_n)_{n\in\mathbb{N}}$. We prove a local limit theorem for $(S_n)_{n\in\mathbb{N}}$ under the annealed law $\mathbb{P}$. As a consequence, we get an equivalent for the annealed…

Probability · Mathematics 2023-09-25 Alexis Devulder

We study the trajectory of a simple random walk on a d-regular graph with d>2 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these…

Probability · Mathematics 2015-05-20 Jiri Cerny , Augusto Teixeira , David Windisch

There is a close connection between intersections of Brownian motion paths and percolation on trees. Recently, ideas from probability on trees were an important component of the multifractal analysis of Brownian occupation measure, in joint…

Probability · Mathematics 2007-05-23 Yuval Peres

In this article we continue the study of the quenched distributions of transient, one-dimensional random walks in a random environment. In a previous article we showed that while the quenched distributions of the hitting times do not…

Probability · Mathematics 2016-06-14 Jonathon Peterson , Gennady Samorodnitsky

In arbitrary spatial dimension $d\ge 1$, we study a generalized model of random walks in a time-varying random environment (RWRE) defined by a stochastic flow of kernels. We consider the quenched probability distribution of the random…

Probability · Mathematics 2025-10-28 Hindy Drillick , Shalin Parekh

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…

Data Structures and Algorithms · Computer Science 2021-02-16 Amartya Shankha Biswas , Edward Pyne , Ronitt Rubinfeld

In this paper, we work on a class of self-interacting nearest neighbor random walks, introduced in [Probab. Theory Related Fields 154 (2012) 149-163], for which there is competition between repulsion of neighboring edges and attraction of…

Probability · Mathematics 2016-03-16 Daniel Kious

We study the simple random walk on stochastic hyperbolic half planar triangulations constructed in Angel and Ray [3]. We show that almost surely the walker escapes the boundary of the map in positive speed and that the return probability to…

Probability · Mathematics 2014-08-20 Omer Angel , Asaf Nachmias , Gourab Ray

Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…

Probability · Mathematics 2019-04-30 Andrea Collevecchio , Kais Hamza , Laurent Tournier

We analyze a class of continuous time random walks in $\mathbb R^d,d\geq 2,$ with uniformly distributed directions. The steps performed by these processes are distributed according to a generalized Dirichlet law. Given the number of changes…

Probability · Mathematics 2015-06-16 Alessandro De Gregorio

A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…

Quantum Physics · Physics 2020-04-08 Suchetana Mukhopadhyay , Parongama Sen

We consider a random walk on a closed manifold $M$ driven by a probability measure $\mu$ on the space of $C^2$ diffeomorphisms. Provided $\mu$ has compact support, satisfies certain gap and pinching conditions, and is weak-$*$ close to a…

Dynamical Systems · Mathematics 2026-05-27 Timothée Bénard , Zhiyuan Zhang

A deterministic walk in a random environment can be understood as a general random process with finite-range dependence that starts repeating a loop once it reaches a site it has visited before. Such process lacks the Markov property. We…

Probability · Mathematics 2012-10-15 Ivan Matic

We study a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider a model in which the trap depth increases…

Statistical Mechanics · Physics 2023-04-12 Aniket Zodage , Rosalind J. Allen , Martin R. Evans , Satya N. Majumdar

Let $(Z_n)_{n\in\N}$ be a $d$-dimensional {\it random walk in random scenery}, i.e., $Z_n=\sum_{k=0}^{n-1}Y(S_k)$ with $(S_k)_{k\in\N_0}$ a random walk in $\Z^d$ and $(Y(z))_{z\in\Z^d}$ an i.i.d. scenery, independent of the walk. The…

Probability · Mathematics 2007-05-23 Nina Gantert , Wolfgang König , Zhan Shi

It is well known that the distribution of simple random walks on $\bf{Z}$ conditioned on returning to the origin after $2n$ steps does not depend on $p= P(S_1 = 1)$, the probability of moving to the right. Moreover, conditioned on…

Probability · Mathematics 2010-06-21 Nina Gantert , Jonathon Peterson

We present a closed-form expression for the survival probability of a biased random walker to first reach a target site on a 1D lattice. The expression holds for any step number $N$ and is computationally faster than non-closed-form results…

Statistical Mechanics · Physics 2025-06-02 Debendro Mookerjee , Sarah Kostinski

Given a discrete-time non-lattice supercritical branching random walk in $\mathbb{R}^d$, we investigate its first passage time to a shifted unit ball of a distance $x$ from the origin, conditioned upon survival. We provide precise…

Probability · Mathematics 2026-04-10 Jose Blanchet , Zhenyuan Zhang

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

We consider random walks in dynamic random environments and propose a criterion which, if satisfied, allows to decompose the random walk trajectory into i.i.d. increments, and ultimately to prove limit theorems. The criterion involves the…

Probability · Mathematics 2024-09-20 Julien Allasia , Rangel Baldasso , Oriane Blondel , Augusto Teixeira
‹ Prev 1 8 9 10 Next ›