English
Related papers

Related papers: Random walks in a strongly sparse random environme…

200 papers

Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…

Quantum Physics · Physics 2025-08-26 Takuya Machida

The goal of this note is to prove a law of large numbers for the empirical speed of a green particle that performs a random walk on top of a field of red particles which themselves perform independent simple random walks on $\Z^d$, $d \geq…

Probability · Mathematics 2013-05-07 Frank den Hollander , Harry Kesten , Vladas Sidoravicius

We consider one infinite path of a Random Walk in Random Environment (RWRE, for short) in an unknown environment. This environment consists of either i.i.d.\ site or bond randomness. At each position the random walker stops and tells us the…

Probability · Mathematics 2021-09-16 Jonas Jalowy , Matthias Löwe

We consider a recurrent random walk (RW) in random environment (RE) on a strip. We prove that if the RE is i. i. d. and its distribution is not supported by an algebraic subsurface in the space of parameters defining the RE then the RW…

Probability · Mathematics 2009-11-13 Erwin Bolthausen , Ilya Goldsheid

A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…

Probability · Mathematics 2013-03-27 Frank den Hollander , Renato dos Santos

We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree. The term \textit{multiplexed} means that the model can be viewed as a nearest…

Probability · Mathematics 2007-05-23 Mikhail Menshikov , Dimitri Petritis , Serguei Popov

We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…

Probability · Mathematics 2025-07-08 Viet Hung Hoang , Kilian Raschel

In previous work by Avena and den Hollander, a model of a one-dimensional random walk in a dynamic random environment was proposed where the random environment is resampled from a given law along a growing sequence of deterministic times.…

Probability · Mathematics 2018-03-12 L. Avena , Y. Chino , C. da Costa , F. den Hollander

We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…

Probability · Mathematics 2007-05-23 Eddy Mayer-Wolf , Alexander Roitershtein , Ofer Zeitouni

We consider random walk on a mildly random environment on finite transitive d- regular graphs of increasing girth. After scaling and centering, the analytic spectrum of the transition matrix converges in distribution to a Gaussian noise. An…

Probability · Mathematics 2011-11-10 Dimitrios Cheliotis , Balint Virag

This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a function of its summands as their number tends to infinity. In the large deviation range of the…

Probability · Mathematics 2014-09-08 Michel Broniatowski , Virgile Caron

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

We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular, we show that the maximum hitting time for a simple random…

Combinatorics · Mathematics 2017-02-15 Dmitri Fomin

We consider a state-dependent, time-dependent, discrete random walks $X_t^{\{a_n\}}$ defined on natural numbers $\mathbb{N}$ (bent to a "stair" in $\mathbb{N}^2$) where the random walk depends on input of a positive deterministic sequence…

Statistics Theory · Mathematics 2019-10-01 Yufan Li , Jeffery Rosenthal

Expanders are sparse graph that are strongly connected, where {\it connectivity} is quantified using eigenvalues of the adjacency matrix, and {\it sparsity} in terms of vertex valency. We give a model of random graphs and study their…

Combinatorics · Mathematics 2025-11-03 Indira Chatterji , Austin Lawson

We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…

Probability · Mathematics 2024-03-05 Marek Biskup , Minghao Pan

Consider a symmetric aperiodic random walk in $Z^d$, $d\geq 3$. There are points (called heavy points) where the number of visits by the random walk is close to its maximum. We investigate the local times around these heavy points and show…

Probability · Mathematics 2007-05-23 Endre Csáki , Antónia Földes , Pál Révész

We study the distribution of dynamical quantities in various one-dimensional, disordered models the critical behavior of which is described by an infinite randomness fixed point. In the {\it disordered contact process}, the quenched…

Disordered Systems and Neural Networks · Physics 2015-06-18 Róbert Juhász

Unlike classical simple random walks, one-dimensional random walks in random environments (RWRE) are known to have a wide array of potential limiting distributions. Under certain assumptions, however, it is known that CLT-like limiting…

Probability · Mathematics 2017-04-12 Sung Won Ahn , Jonathon Peterson

A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…

Probability · Mathematics 2023-11-28 Zhishui Hu , Yiting Zhang