Related papers: Cutoff for Almost All Random Walks on Abelian Grou…

We analyse a random walk on the ring of integers mod $n$, which at each time point can make an additive `step' or a multiplicative `jump'. When the probability of making a jump tends to zero as an appropriate power of $n$ we prove the…

In this short note we give various near optimal characterizations of random walks over finite Abelian groups with large maximum discrepancy from the uniform measure. We also provide several interesting connections to existing results in the…

We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric criteria, which are easy to verify and allow to determine…

The cutoff phenomenon was recently confirmed for random walks on Ramanujan graphs by the first author and Peres. In this work, we obtain analogs in higher dimensions, for random walk operators on any Ramanujan complex associated with a…

We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction…

We analyze a Markov chain, known as the product replacement chain, on the set of generating $n$-tuples of a fixed finite group $G$. We show that as $n \rightarrow \infty$, the total-variation mixing time of the chain has a cutoff at time…

We define matrix groups $FG_n(P)$ for each natural number $n$ and finite set of primes $P$, such that every rational-valued upper triangular matrix group is a (possibly distorted) subgroup. Brofferio and Schapira [Brofferio2011poisson],…

We find Gaussian cutoff profiles for the total variation distance to stationarity of a random walk on a multiplex network: a finite number of directed configuration models sharing a vertex set, each with its own bounded degree distribution…

The finite dihedral group generated by one rotation and one reflection is the simplest case of the non-abelian group. Cayley graphs are diagrammatic counterparts of groups. In this paper, much attention is given to the Cayley graph of the…

We consider congestion dynamics with $n$ players and $Q$ resources under the constraint that the number of each resource is $\kappa$ and that $n<\kappa Q$ in the regime that $n$ and $\kappa$ diverge but $Q$ is fixed with $n=\lfloor{\rho…

We prove asymptotic equivalents for finite-level representations of symmetric groups, that is, for Young diagrams having all but finitely many boxes on their first row. We deduce that random walks on symmetric groups generated by conjugacy…

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…

We present an overview of the representation theoretic techniques used to study the mixing times of random walks on finite groups. We focus on the card shuffle studied by Diaconis and Shahshahani in the 1980s and a recent improvement on…

A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…

The power graph of a group is the simple graph with vertices as the group elements, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. We study (minimal) cut-sets of the…

Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…

We consider a random geometric graph obtained by placing a Poisson point process of intensity 1 in the d-dimensional torus of side length n^(1/d) and connecting two points by an edge if their distance is at most r. We consider the case of…

Consider symmetric simple exclusion processes, with or without Glauber dynamics on the boundary set, on a sequence of connected unweighted graphs $G_N=(V_N,E_N)$ which converge geometrically and spectrally to a compact connected metric…

For a finitely generated group G and a banach space X let \alpha^*_X(G) (respectively \alpha^#_X(G)) be the supremum over all \alpha\ge 0 such that there exists a Lipschitz mapping (respectively an equivariant mapping) f:G\to X and c>0 such…

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…