Related papers: Mixing and cut-off in cycle walks

A classical lazy random walk on cycles is known to mix to the uniform distribution. In contrast, we show that a continuous-time quantum walk on cycles exhibit strong non-uniform mixing properties. Our results include the following: - The…

We show that for lazy simple random walks on finite spherically symmetric trees, the ratio of the mixing time and the relaxation time is bounded by a universal constant. Consequently, lazy simple random walks on any sequence of finite…

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…

This work deals with both instantaneous uniform mixing property and temporal standard deviation for continuous-time quantum random walks on circles in order to study their fluctuations comparing with discrete-time quantum random walks, and…

We study a Markov chain on $\mathbb{R}_+ \times S$, where $\mathbb{R}_+$ is the non-negative real numbers and $S$ is a finite set, in which when the $\mathbb{R}_+$-coordinate is large, the $S$-coordinate of the process is approximately…

The cutoff phenomenon was recently shown to systematically follow from non-negative curvature and the product condition, for all Markov diffusions. The proof crucially relied on a classical \emph{chain rule} satisfied by the carr\'e du…

For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…

The cutoff phenomenon describes a sharp transition in the convergence of a Markov chain to equilibrium. In recent work, the authors established cutoff and its location for the stochastic Ising model on the $d$-dimensional torus $(Z/nZ)^d$…

We describe the full exit boundary of random walks on homogeneous trees, in particular, on the free groups. This model exhibits a phase transition, namely, the family of Markov measures under study loses ergodicity as a parameter of the…

In this paper, we investigate the mixing time of the simple exclusion process on the circle with $N$ sites, with a number of particle $k(N)$ tending to infinity, both from the worst initial condition and from a typical initial condition. We…

Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…

In this paper, we study the mixing time of the simple exclusion process with $k$ particles in the line segment $[1, N]$ with conductances $c^{(N)}(x, x+1)_{1\le x<N}$ where $c^{(N)}(x, x+1)>0$ is the rate of swapping the contents of the two…

We study a class of non-reversible, continuous-time random walks in random environments on $\mathbb{Z}^d$ that admit a cycle representation with finite cycle length. The law of the transition rates, taking values in $[0, \infty)$, is…

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…

We consider the random Cayley graphs of a sequence of finite nilpotent groups of diverging sizes $G=G(n)$, whose ranks and nilpotency classes are uniformly bounded. For some $k=k(n)$ such that $1\ll\log k \ll \log |G|$, we pick a random set…

We show that the random transposition walk on the symmetric group $S_n$ has cutoff in separation distance at $\frac{1}{2}n \log n$, by constructing a strong stationary time. The construction involves working with cycle types of permutations…

We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order…

Let $P$ be the transition matrix of a finite, irreducible and reversible Markov chain. We say the continuous time Markov chain $X$ has transition matrix $P$ and speed $\lambda$ if it jumps at rate $\lambda$ according to the matrix $P$. Fix…

Suppose that G and H are finite, connected graphs, G regular, X is a lazy random walk on G and Z is a reversible ergodic Markov chain on H. The generalized lamplighter chain X* associated with X and Z is the random walk on the wreath…

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 +…