Related papers: Aldous-type Spectral Gaps in Unitary Groups

The second largest eigenvalue of a transition matrix $P$ has connections with many properties of the underlying Markov chain, and especially its convergence rate towards the stationary distribution. In this paper, we give an asymptotic…

Random reversible and quantum circuits form random walks on the alternating group $\mathrm{Alt}(2^n)$ and unitary group $\mathrm{SU}(2^n)$, respectively. Known bounds on the spectral gap for the $t$-th moment of these random walks have…

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

It is well known that the spectral gap of the down-up walk over an $n$-partite simplicial complex (also known as Glauber dynamics) cannot be better than $O(1/n)$ due to natural obstructions such as coboundaries. We study an alternative…

We propose to study unitary matrix ensembles defined in terms of unitary stochastic transition matrices associated with Markov processes on graphs. We argue that the spectral statistics of such an ensemble (after ensemble averaging) depends…

In 2020, F. Cesi introduced a random walk on the hyperoctahedral group $B_n$ and analysed its spectral gap when the allowed generators are transpositions and diagonal elements corresponding to singletons. In this paper we extend the allowed…

Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…

We prove a version of the moving particle lemma for the exclusion process on any finite weighted graph, based on the octopus inequality of Caputo, Liggett, and Richthammer. In light of their proof of Aldous' spectral gap conjecture, we…

The paper is concerned with random $S$-adic systems arising from an i.i.d. sequence of unimodular substitutions. Using equidistribution results of Benoist and Quint, we show in Theorem 3.3 that, under some natural assumptions, if the…

Let $V=\mathbb R^d$ be the Euclidean $d$-dimensional space, $\mu$ (resp $\lambda$) a probability measure on the linear (resp affine) group $G=G L (V)$ (resp $H= \Aff (V))$ and assume that $\mu$ is the projection of $\lambda$ on $G$. We…

We consider the asymptotic behavior as $n\to\infty$ of the spectra of random matrices of the form \[\frac{1}{\sqrt{n-1}}\sum_{k=1}^{n-1}Z_{nk}\rho_n ((k,k+1)),\] where for each $n$ the random variables $Z_{nk}$ are i.i.d. standard Gaussian…

We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to…

We show that random walks on semisimple algebraic groups do not concentrate on proper algebraic subvarieties with uniform exponential rate of anti-concentration. This is achieved by proving a uniform spectral gap for quasi-regular…

We prove the spectral gap property for random walks on the product of two non-locally isomorphic analytic real or p-adic compact groups with simple Lie algebras, under the necessary condition that the marginals posses a spectral gap.…

The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…

In the present paper, we consider a class of Markov processes on the discrete circle which has been introduced by K\"onig, O'Connell and Roch. These processes describe movements of exchangeable interacting particles and are discrete…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…

We establish a sharp lower bound on the spectral gap of the biased adjacent-transposition Markov chain on the symmetric group. As a consequence, we resolve a longstanding conjecture of Fill, proving that among all regular probability…

We consider general transformations of random walks on groups determined by Markov stopping times and prove that the asymptotic entropy (resp., rate of escape) of the transformed random walks is equal to the asymptotic entropy (resp., rate…