Related papers: Mixing Times for the Commuting Chain on CA Groups

We investigate a novel variant of the exclusion process in which particles perform asymmetric nearest-neighbor jumps across a bond \((k, k+1)\) only if the preceding site \((k-1)\) is unoccupied. This next-nearest-neighbor constraint…

We give a bound on the mixing time of a uniformly ergodic, reversible Markov chain in terms of the spectral radius of the transition operator. This bound has been established previously in finite state spaces, and is widely believed to hold…

We derive a nearly optimal upper bound on the running time in the adiabatic theorem for a switching family of Hamiltonians. We assume the switching Hamiltonian is in the Gevrey class $G^\alpha$ as a function of time, and we show that the…

If $H$ is a subgroup of a compact group $G$, the probability that a random element of $H$ commutes with a random element of $G$ is denoted by $Pr(H,G)$. Let $\langle g\rangle$ stand for the monothetic subgroup generated by an element $g\in…

We analyze the mixing behavior of the biased exclusion process on a path of length $n$ as the bias $\beta_n$ tends to $0$ as $n \to \infty$. We show that the sequence of chains has a pre-cutoff, and interpolates between the unbiased…

The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of…

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…

In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…

In this article, we introduce the study of a class of finite groups $G$ which admits a subgroup which intersects all non-trivial subgroups of $G$. We also explore a subclass of it consisting of all groups $G$ in which the prime order…

Two quantum systems, each described as a random-matrix ensemble. are coupled to each other via a number of transition states. Each system is strongly coupled to a large number of channels. The average transmission probability is the product…

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

We study the mixing time of the averaging process on a large random $d$-regular graph, $d\ge 3$, and prove an $L^2$-cutoff with an explicit cutoff time. Somewhat surprisingly, we uncover a phase transition at the finite, fixed degree…

A recent result of Ding, Lee and Peres expresses the cover time of the random walk on a graph in terms of generic chaining for the commute distance. Their proof is very involved and the purpose of this article is to present a simpler…

Kac's walk on the rotation group, introduced by Hastings in 1970, is an important high-dimensional Markov chain with applications in statistical physics, statistics, cryptography, and computational science. Despite its simple transition…

A deck of $n$ cards are shuffled by repeatedly taking off the top card, flipping it with probability $1/2$, and inserting it back into the deck at a random position. This process can be considered as a Markov chain on the group $B_n$ of…

Chain event graphs are a family of probabilistic graphical models that generalise Bayesian networks and have been successfully applied to a wide range of domains. Unlike Bayesian networks, these models can encode context-specific…

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…

Intracellular processes often rely on the timely encounter of mobile reaction partners, including intermittently motor-driven organelles. The underlying cytoskeletal network presents a complex landscape that both directs particle movement…

This paper presents some new results on the conditional joint probability distributions of phase-type under the mixture of right-continuous Markov jump processes with absorption on the same finite state space $\mathbb{S}$ moving at…

A known limitation of time-dependent mean-field approaches is a lack of quantum tunneling for collective motions such as in sub-barrier fusion reactions. As a first step toward a solution, a time-dependent model is considered using a…