English
Related papers

Related papers: Isoperimetric inequalities and mixing time for a r…

200 papers

We consider a two-speed branching random walk, which consists of two macroscopic stages with different reproduction laws. We prove that the centered maximum converges in law to a Gumbel variable with a random shift and the extremal process…

Probability · Mathematics 2025-03-11 Lianghui Luo

We introduce a Markov chain for sampling from the uniform distribution on a Riemannian manifold $\mathcal{M}$, which we call the $\textit{geodesic walk}$. We prove that the mixing time of this walk on any manifold with positive sectional…

Probability · Mathematics 2017-11-28 Oren Mangoubi , Aaron Smith

Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…

Probability · Mathematics 2008-05-07 Mathias Becker , Wolfgang Konig

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 analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…

Probability · Mathematics 2025-04-28 Luca Avena , Remco van der Hofstad , Frank den Hollander , Oliver Nagy

Let $d$ be a positive integer and $A$ a set in $\mathbb{Z}^d$, which contains finitely many points with integer coordinates. We consider $X$ a standard random walk perturbed on the set $A$, that is, a Markov chain whose transition…

Probability · Mathematics 2023-12-27 Congzao Dong , Alexander Iksanov , Andrey Pilipenko

For a random walk $S_n, n\geq 0$ in $\mathbb{Z}^d$, let $l(n,x)$ be its local time at the site $x\in \mathbb{Z}^d$. Define the $\alpha$-fold self intersection local time $L_n(\alpha) := \sum_{x} l(n,x)^{\alpha}$, and let…

Probability · Mathematics 2015-06-04 George Deligiannidis , Sergey Utev

We consider the scaling behavior of the range and $p$-multiple range, that is the number of points visited and the number of points visited exactly $p\geq 1$ times, of simple random walk on ${\mathbb Z}^d$, for dimensions $d\geq 2$, up to…

Probability · Mathematics 2020-03-25 Thomas Doehrman , Sunder Sethuraman , Shankar C. Venkataramani

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

The ensemble properties and time-averaged observables of a memory-induced diffusive-superdiffusive transition are studied. The model consists in a random walker whose transitions in a given direction depend on a weighted linear combination…

Statistical Mechanics · Physics 2017-05-11 Adrian A. Budini

We study the asymptotic behaviour of a random walk whose evolution is dependent on the state of an itself dynamically evolving environment. In particular, we extend our previous results in [Bethuelsen and V\"ollering, 2016] and prove a…

Probability · Mathematics 2024-11-21 Stein Andreas Bethuelsen , Florian Völlering

We study the long-time behavior of the probability density associated with the decoupled continuous-time random walk which is characterized by a superheavy-tailed distribution of waiting times. It is shown that if the random walk is…

Statistical Mechanics · Physics 2011-05-02 S. I. Denisov , H. Kantz

We study the mixing time of the Dikin walk in a polytope - a random walk based on the log-barrier from the interior point method literature. This walk, and a close variant, were studied by Narayanan (2016) and Kannan-Narayanan (2012).…

Data Structures and Algorithms · Computer Science 2016-08-10 Sushant Sachdeva , Nisheeth K. Vishnoi

We present an affine-invariant random walk for drawing uniform random samples from a convex body $\mathcal{K} \subset \mathbb{R}^n$ that uses maximum volume inscribed ellipsoids, known as John's ellipsoids, for the proposal distribution.…

Machine Learning · Statistics 2020-07-24 Adam Gustafson , Hariharan Narayanan

We study the mixing time of a random walk on the torus, alternated with a Lebesgue measure preserving Bernoulli map. Without the Bernoulli map, the mixing time of the random walk alone is $O(1/\epsilon^2)$, where $\epsilon$ is the step…

Probability · Mathematics 2023-03-28 Gautam Iyer , Ethan Lu , James Nolen

We study the mixing time of the averaging process on a large random $d$-regular graph, $d\ge 3$, and prove an $L^2$-cutoff with an explicit cutoff time. Somewhat surprisingly, we uncover a phase transition at the finite, fixed degree…

Probability · Mathematics 2026-03-03 Pietro Caputo , Matteo Quattropani , Federico Sau

We consider a supercritical branching random walk in time-inhomogeneous random environment with a random absorption barrier, i.e.,in each generation, only the individuals born below the barrier can survive and reproduce. Assume that the…

Probability · Mathematics 2023-06-06 You Lv , Wenming Hong

Given a sequence $(\mathfrak{X}_i, \mathscr{K}_i)_{i=1}^\infty$ of Markov chains, the cut-off phenomenon describes a period of transition to stationarity which is asymptotically lower order than the mixing time. We study mixing times and…

Number Theory · Mathematics 2021-05-25 Bob Hough

We study biased random walk on the infinite connected component of supercritical percolation on the integer lattice $\mathbb{Z}^d$ for $d\geq 2$. For this model, Fribergh and Hammond showed the existence of an exponent $\gamma$ such that:…

Probability · Mathematics 2022-05-10 Adam M. Bowditch , David A. Croydon

We study the random walk on a finite dihedral group $G$ driven by the uniform measure on $k$ independently and uniformly chosen elements. We show that the walk exhibits cutoff with high probability throughout nearly the entire regime $1 \ll…

Probability · Mathematics 2025-10-24 Xiangying Huang , Renyu Rao