Related papers: Mixing of a generic simple symmetric random walk o…

Fix an irrational number $\alpha$ and a smooth, positive, real function $\mathfrak{p}$ on the circle. If current position is $x\in \mathbb R/\mathbb Z$ then in the next step jump to $x+\alpha$ with probability $\mathfrak{p}(x)$ or to…

We discuss conditions for unique ergodicity of a collective random walk on a continuous circle. Individual particles in this collective motion perform independent (and different in general) random walks conditioned by the assumption that…

We begin by giving a new proof of the equivalence between the Liouville property and vanishing of the drift for symmetric random walks with finite first moments on finitely generated groups; a result which was first established by…

We prove that mixing on rank-one transformations is equivalent to the spacer sequence being slice-ergodic. Slice-ergodicity, introduced in this paper, generalizes the notion of ergodic sequence to the uniform convergence of ergodic averages…

We prove that a rank one transformation satisfying a condition called restricted growth is a mixing transformation if and only if the spacer sequence for the transformation is uniformly ergodic. Uniform ergodicity is a generalization of the…

We study a simple random walk on Z^2 with constraints on the axis. Motivation comes from physics when particles (a gas for example, see [Dal88]) are submitted to a local field. In our case we assume that the particle evolves freely in the…

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

Many regular graphs admit a natural partition of their edge set into cliques of the same order such that each vertex is contained in the same number of cliques. In this paper, we study the mixing rate of certain random walks on such graphs…

We study a random walk on $\mathbb{F}_p$ defined by $X_{n+1}=1/X_n+\varepsilon_{n+1}$ if $X_n\neq 0$, and $X_{n+1}=\varepsilon_{n+1}$ if $X_n=0$, where $\varepsilon_{n+1}$ are independent and identically distributed. This can be seen as a…

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…

We study N interacting random walks on the positive integers. Each particle has drift {\delta} towards infinity, a reflection at the origin, and a drift towards particles with lower positions. This inhomogeneous mean field system is shown…

Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…

Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…

We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…

It has been shown that in one dimension the environment viewed by the particle process (EVP process) in quasi periodic random environment is uniquely ergodic and mixing under mild additional assumptions. Here we construct an analytic quasi…

Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time…

We study random walks on the giant component of the Erd\H{o}s-R\'enyi random graph ${\cal G}(n,p)$ where $p=\lambda/n$ for $\lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently…

Eppstein and Frishberg recently proved that the mixing time for the simple random walk on the $1$-skeleton of the associahedron is $O(n^3\log^3 n)$. We obtain similar rapid mixing results for the simple random walks on the $1$-skeleta of…

Fix an irrational number $\alpha$, and consider a random walk on the circle in which at each step one moves to $x+\alpha$ or $x-\alpha$ with probabilities $1/2, 1/2$ provided the current position is $x$. If an observable is given we can…

Squaring and adding $\pm 1$ mod p generates a curiously intractable random walk. A similar process over the finite field $\mathbf{F}_q$ (with $q=2^d$) leads to novel connections between elementary Galois theory and probability.