Related papers: Cutoff for the Transposition Walk on Permutations …
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…
We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well…
We consider a directed version of the classical Stochastic Block Model with $m\ge 2$ communities and a parameter $\alpha$ controlling the inter-community connectivity. We show that, depending on the scaling of $\alpha$, the mixing time of…
This paper considers non-backtracking random walks on random graphs generated according to the configuration model. The quantity of interest is the scaling of the mixing time of the random walk as the number of vertices of the random graph…
The cutoff phenomenon describes a sharp transition in the convergence of an ergodic finite Markov chain to equilibrium. Of particular interest is understanding this convergence for the simple random walk on a bounded-degree expander graph.…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
A sequence of chains exhibits (total-variation) cutoff (resp., pre-cutoff) if for all $0<\epsilon< 1/2$, the ratio $t_{\mathrm{mix}}^{(n)}(\epsilon)/t_{\mathrm{mix}}^{(n)}(1-\epsilon)$ tends to 1 as $n \to \infty $ (resp., the $\limsup$ of…
We derive upper and lower bounds on the convergence behavior of certain classes of one-parameter quantum dynamical semigroups. The classes we consider consist of tensor product channels and of channels with commuting Liouvillians. We…
Given a labelled tournament on $[n]$, \emph{inverting} a vertex subset $X$ means reversing every edge with both endpoints in $X$. Alon, Powierski, Savery, Scott, and Wilmer~\cite{AlonPowierskiSaveryScottWilmer2024} asked for the mixing time…
We construct a family of trees on which a lazy simple random walk exhibits total variation cutoff. The main idea behind the construction is that hitting times of large sets should be concentrated around their means. For this sequence of…
The cutoff phenomenon describes the case when an abrupt transition occurs in the convergence of a Markov chain to its equilibrium measure. There are various metrics which can be used to measure the distance to equilibrium, each of which…
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 present a computational study of finite-time mixing of a line segment by cutting and shuffling. A family of one-dimensional interval exchange transformations is constructed as a model system in which to study these types of mixing…
The best known lower and upper bounds on the mixing time for the random-to-random insertions shuffle are $(1/2-o(1))n\log n$ and $(2+o(1))n\log n$. A long standing open problem is to prove that the mixing time exhibits a cutoff. In…
In this paper, we are interested in the impact of communities on the mixing behavior of the non-backtracking random walk. We consider sequences of sparse random graphs of size $N$ generated according to a variant of the classical…
The total-variation cutoff phenomenon has been conjectured to hold for simple random walk on all transitive expanders. However, very little is actually known regarding this conjecture, and cutoff on sparse graphs in general. In this paper…
In this article, we consider products of random walks on finite groups with moderate growth and discuss their cutoffs in the total variation. Based on several comparison techniques, we are able to identify the total variation cutoff of…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an…
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…