Related papers: Rapid mixing and Markov bases

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

The motivation of this work is to extend the techniques of higher order random walks on simplicial complexes to analyze mixing times of Markov chains for combinatorial problems. Our main result is a sharp upper bound on the second…

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…

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…

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…

Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…

We present a general method to derive the metastable behavior of weakly mixing Markov chains. This approach is based on properties of the resolvent equations and can be applied to metastable dynamics which do not satisfy the mixing…

Lifted Markov chains are Markov chains on graphs with added local "memory" and can be used to mix towards a target distribution faster than their memoryless counterparts. Upper and lower bounds on the achievable performance have been…

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…

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).…

In [4], we examined the use of coupling to obtain bounds on the mixing time of statistics on Markov chains. In the present paper, we consider the same general problem, but using strong stationary times rather than coupling. We discuss…

Graphs on lattice points are studied whose edges come from a finite set of allowed moves of arbitrary length. We show that the diameter of these graphs on fibers of a fixed integer matrix can be bounded from above by a constant. We then…

This work focuses on the quantum mixing time, which is crucial for efficient quantum sampling and algorithm performance. We extend Richter's previous analysis of continuous time quantum walks on the periodic lattice $\mathbb{Z}_{n_1}\times…

We prove results for random walks in dynamic random environments which do not require the strong uniform mixing assumptions present in the literature. We focus on the "environment seen from the walker"-process and in particular its…

Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of techniques to estimate their mixing time. In this paper, we study the mixing time of random walks in dynamic random environments. To that end,…

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

Quantum walks on graphs have been shown in certain cases to mix quadratically faster than their classical counterparts. Lifted Markov chains, consisting of a Markov chain on an extended state space which is projected back down to the…

Locally Markov walks are natural generalizations of classical Markov chains, where instead of a particle moving independently of the past, it decides where to move next depending on the last action performed at the current location. We…

It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregular graphs, let $G$ be a random graph on $n$ vertices with…