Related papers: Mixing Times for the Commuting Chain on CA Groups
The Szegedy quantum walk is a discrete time quantum walk model which defines a quantum analogue of any Markov chain. The long-term behavior of the quantum walk can be encoded in a matrix called the average mixing matrix, whose columns give…
We study the mixing time of the symmetric beta-binomial splitting process on finite weighted connected graphs $G=(V,E,\{r_e\}_{e\in E})$ with vertex set $V$, edge set $E$ and positive edge-weights $r_e>0$ for $e\in E$. This is an…
Mixture model-based clustering, usually applied to multidimensional data, has become a popular approach in many data analysis problems, both for its good statistical properties and for the simplicity of implementation of the…
We consider the East model in $\mathbb Z^d$, an example of a kinetically constrained interacting particle system with oriented constraints, together with one of its natural variant. Under any ergodic boundary condition it is known that the…
We consider the random walk on a simple point process on $\Bbb{R}^d$, $d\geq2$, whose jump rates decay exponentially in the $\alpha$-power of jump length. The case $\alpha =1$ corresponds to the phonon-induced variable-range hopping in…
One-dimensional non-equilibrium models of particles subjected to a coagulation-diffusion process are important in understanding non-equilibrium dynamics, and fluctuation-dissipation relation. We consider in this paper transport properties…
We study the totally asymmetric simple exclusion process with open boundaries in the high density and the low density phase. In the bulk of the two phases, we show that the process on a segment of length $N$ exhibits cutoff at order $N$,…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
The commuting probability of a finite group is defined to be the probability that two randomly chosen group elements commute. Let P \subset (0,1] be the set of commuting probabilities of all finite groups. We prove that every point of P is…
We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application…
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time…
The Burnside process is a classical Markov chain for sampling uniformly from group orbits. We introduce the dual Burnside process, obtained by interchanging the roles of group elements and states. This dual chain has stationary law…
In many systems, the time scales of the microscopic dynamics and macroscopic dynamics of interest are separated by many orders of magnitude. Examples abound, for instance nucleation, protein folding, and chemical reactions. For these…
We consider the zero-range process with arbitrary bounded monotone rates on the complete graph, in the regime where the number of sites diverges while the density of particles per site converges. We determine the asymptotics of the mixing…
The (standard) average mixing matrix of a continuous-time quantum walk is computed by taking the expected value of the mixing matrices of the walk under the uniform sampling distribution on the real line. In this paper we consider…
To model a complex system intrinsically separated by a barrier, we use two random Hamiltonians, coupled to each other either by a tunneling matrix element or by an intermediate transition state. We study that model in the universal limit of…
We study the Hamiltonian dynamics of a one-dimensional chain of linearly coupled particles in a spatially periodic potential which is subjected to a time-periodic mono-frequency external field. The average over time and space of the related…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-on-solid model of statistical physics. This model has been proposed, among other things, as an idealization of the behavior of…