English
Related papers

Related papers: Loop pruning and downward deviations for maximum l…

200 papers

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

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

We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…

Probability · Mathematics 2023-03-31 Amine Asselah , Bruno Schapira , Perla Sousi

We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC'10] show…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-10-18 Danupon Nanongkai , Atish Das Sarma , Gopal Pandurangan

We derive an annealed large deviation principle for the normalised local times of a continuous-time random walk among random conductances in a finite domain in $\Z^d$ in the spirit of Donsker-Varadhan \cite{DV75}. We work in the interesting…

Probability · Mathematics 2011-04-11 Wolfgang König , Michele Salvi , Tilman Wolff

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…

Probability · Mathematics 2026-05-19 Ngo P. N. Ngoc , Tuan-Minh Nguyen

We consider discrete-time branching random walks with a radially symmetric distribution. Independently of each other individuals generate offspring whose relative locations are given by a copy of a radially symmetric point process…

Probability · Mathematics 2025-08-11 Viktor Bezborodov , Nina Gantert

We prove non-asymptotic lower bounds on the expectation of the maximum of $d$ independent Gaussian variables and the expectation of the maximum of $d$ independent symmetric random walks. Both lower bounds recover the optimal leading…

Machine Learning · Statistics 2015-11-09 Francesco Orabona , David Pal

We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…

Statistical Mechanics · Physics 2015-06-24 Timo Aspelmeier , Jérôme Magnin , Willi Graupner , Uwe C. Täuber

We investigate random walks on the general linear group constrained within a specific domain, with a focus on their asymptotic behavior. In a previous work [38], we constructed the associated harmonic measure, a key element in formulating…

Probability · Mathematics 2025-07-16 Ion Grama , Jean-François Quint , Hui Xiao

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…

Probability · Mathematics 2012-12-12 Lung-Chi Chen , Rongfeng Sun

We present a systematic analytical approach to the trapping of a random walk by a finite density rho of diffusing traps in arbitrary dimension d. We confirm the phenomenologically predicted e^{-c_d rho t^{d/2}} time decay of the survival…

Statistical Mechanics · Physics 2009-11-07 F. van Wijland

We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…

Probability · Mathematics 2017-02-01 Siva Athreya , Alexander Drewitz , Rongfeng Sun

We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…

Probability · Mathematics 2018-11-27 Amir Dembo , Ryoki Fukushima , Naoki Kubota

We obtain the leading orders of the maximum and the minimum of local times for the simple random walk on the two-dimensional torus at time proportional to the cover time. We also estimate the number of points with large (or small) values of…

Probability · Mathematics 2014-10-22 Yoshihiro Abe

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

We establish the quenched local limit theorem for reversible random walk on $\Z^d$ (with $d\ge 2$) among stationary ergodic random conductances that permit jumps of arbitrary length. The proof is based on the weak parabolic Harnack…

Probability · Mathematics 2024-04-11 Xin Chen , Takashi Kumagai , Jian Wang

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

Probability · Mathematics 2017-07-06 Yueyun Hu

Consider a class of null-recurrent randomly biased walks on a super-critical Gaton-Watson tree. We obtain the rates of convergence of the local times and the quenched local probability for the biased walk in the sub-diffusive case. These…

Probability · Mathematics 2019-01-03 Yueyun Hu

In this paper we study the probability that a $d$ dimensional simple random walk (or the first $L$ steps of it) covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball. We show that among all such paths,…

Probability · Mathematics 2017-04-26 Eviatar B. Procaccia , Yuan Zhang