相关论文: On Rapid mixing for random walks on nilmanifolds

We consider completely irrational nilflows on any nilmanifold of step at least $2$. We show that there exists a dense set of smooth time-changes such that any time-change in this class which is not measurably trivial gives rise to a mixing…

We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

We prove a law of large numbers for a class of multidimensional random walks in random environments where the environment satisfies appropriate mixing conditions, which hold when the environment is a weak mixing field in the sense of…

The purpose of this note is to establish convergence of random walks on the moduli space of Abelian differentials on compact Riemann surfaces in two different modes: convergence of the $n$-step distributions from almost every starting point…

We show sufficient conditions under which the \textsc{BallWalk} algorithm mixes fast in a bounded connected subset of $\Real^n$. In particular, we show fast mixing if the space is the transformation of a convex space under a smooth…

The mixing behaviour of random walks on lattice points of polytopes using Markov bases is examined. It is shown that under a dilation of the underlying polytope, these random walks do not mix rapidly when a fixed Markov basis is used. We…

In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…

We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…

We prove effective density of random walks on homogeneous spaces, assuming that the underlying measure is supported on matrices generating a dense subgroup and having algebraic entries. The main novelty is an argument passing from high…

We prove a sharp rate of convergence to stationarity for a natural random walk on a compact Riemannian manifold $(M,g)$. The proof includes a detailed study of the spectral theory of the associated operator.

We compute the mixing rate of a non-backtracking random walk on a regular expander. Using some properties of Chebyshev polynomials of the second kind, we show that this rate may be up to twice as fast as the mixing rate of the simple random…

We prove that random walks in random environments, that are exponentially mixing in space and time, are almost surely diffusive, in the sense that their scaling limit is given by the Wiener measure.

We prove new mixing rate estimates for the random walks on homogeneous spaces determined by a probability distribution on a finite group $G$. We introduce the switched random walk determined by a finite set of probability distributions on…

We study a natural random walk on the $n \times n$ upper triangular matrices, with entries in $\mathbb{Z}/m \mathbb{Z}$, generated by steps which add or subtract a uniformly random row to the row above. We show that the mixing time of this…

We consider random walks in strong-mixing random Gibbsian environments in $\mathbb{Z}^d, d\ge 2$. Based on regeneration arguments, we will first provide an alternative proof of Rassoul-Agha's conditional law of large numbers (CLLN) for…

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 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 construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any $m$ and $k$ a random walk with $k$-wise independent steps which has no stationary distribution modulo $m$.

The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of…