English
Related papers

Related papers: Total variation bound for Kac's random walk

200 papers

We show that on every Ramanujan graph $G$, the simple random walk exhibits cutoff: when $G$ has $n$ vertices and degree $d$, the total-variation distance of the walk from the uniform distribution at time $t=\frac{d}{d-2}\log_{d-1} n +…

Probability · Mathematics 2016-08-25 Eyal Lubetzky , Yuval Peres

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

In this paper, we obtain an explicit total variation bound in the central limit theorem for the sums of non-i.i.d. random variables. Our results show that, under suitable assumptions, Lindeberg's condition is sufficient and necessary for…

Probability · Mathematics 2025-11-25 N. T. Dung , H. T. P. Thao

We prove a moderate deviation principle for the capacity of the range of random walk in $\mathbb{Z}^5$. Depending on the scale of deviation, we get two different regimes. We observe Gaussian tails when the deviation scale is smaller than…

Probability · Mathematics 2025-11-11 Arka Adhikari , Jiyun Park

Denote by $L_n$ the length of the perimeter of the convex hull of $n$ steps of a planar random walk whose increments have finite second moment and non-zero mean. Snyder and Steele showed that $n^{-1} L_n$ converges almost surely to a…

Probability · Mathematics 2015-04-27 Andrew R. Wade , Chang Xu

As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…

Combinatorics · Mathematics 2016-08-10 Simão Herdade , Van Vu

We study the rate of convergence of the Markov chain on $S_n$ which starts with a random $(n-k)$-cycle for a fixed $k \geq 1$, followed by random transpositions. The convergence to the stationary distribution turns out to be of order $n$.…

Probability · Mathematics 2018-03-26 Alperen Y. Özdemir

There is a long history of establishing central limit theorems for Markov chains. Quantitative bounds for chains with a spectral gap were proved by Mann and refined later. Recently, rates of convergence for the total variation distance were…

Probability · Mathematics 2023-08-24 Rafael Chiclana , Yuval Peres

Random walks in random scenery are processes defined by $$Z_n:=\sum_{k=1}^n\omega_{S_k}$$ where $S:=(S_k,k\ge 0)$ is a random walk evolving in $\mathbb{Z}^d$ and $\omega:=(\omega_x, x\in{\mathbb Z}^d)$ is a sequence of i.i.d. real random…

Probability · Mathematics 2014-09-29 Nadine Guillotin-Plantard , Julien Poisat

Answering a question by Angel, Holroyd, Martin, Wilson and Winkler, we show that the maximal number of non-colliding coupled simple random walks on the complete graph $K_N$, which take turns, moving one at a time, is monotone in $N$. We use…

Probability · Mathematics 2016-06-08 Ohad Noy Feldheim

We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [-a,a]. For a of the order of one, the exit probabilities to each edge of the…

Data Analysis, Statistics and Probability · Physics 2007-05-23 T. Antal , S. Redner

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

Dynamical Systems · Mathematics 2015-08-17 Péter Pál Varjú

Fix integers $d \geq 2$ and $k\geq d-1$. Consider a random walk $X_0, X_1, \ldots$ in $\mathbb{R}^d$ in which, given $X_0, X_1, \ldots, X_n$ ($n \geq k$), the next step $X_{n+1}$ is uniformly distributed on the unit ball centred at $X_n$,…

Probability · Mathematics 2020-01-16 Francis Comets , Mikhail V. Menshikov , Andrew R. Wade

We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…

Statistical Mechanics · Physics 2009-11-11 Alain Comtet , Satya N. Majumdar

We study the model of random permutations of $n$ objects with polynomially growing cycle weights, which was recently considered by Ercolani and Ueltschi, among others. Using saddle-point analysis, we prove that the total variation distance…

Probability · Mathematics 2014-10-21 Julia Storm , Dirk Zeindler

We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for…

Mathematical Physics · Physics 2019-11-26 Youjin Deng , Timothy M Garoni , Jens Grimm , Abrahim Nasrawi , Zongzheng Zhou

We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…

Probability · Mathematics 2007-09-01 Martin T. Barlow , Antal A. Jarai , Takashi Kumagai , Gordon Slade

We show bounds on total variation and $L^{\infty}$ mixing times, spectral gap and magnitudes of the complex valued eigenvalues of a general (non-reversible non-lazy) Markov chain with a minor expansion property. This leads to the first…

Combinatorics · Mathematics 2009-04-03 Ravi Montenegro

We derive a local limit theorem for normal, moderate, and large deviations for symmetric simple random walk on the square lattice in dimensions one and two that is an improvement of existing results for points that are particularly distant…

Probability · Mathematics 2020-05-12 Christian Beneš

Running a random walk in a convex body $K\subseteq\mathbb{R}^n$ is a standard approach to sample approximately uniformly from the body. The requirement is that from a suitable initial distribution, the distribution of the walk comes close…

Data Structures and Algorithms · Computer Science 2024-12-18 Hariharan Narayanan , Amit Rajaraman , Piyush Srivastava