Related papers: Mixing Times for the Commuting Chain on CA Groups
Metastability is a physical phenomenon ubiquitous in first order phase transitions. A fruitful mathematical way to approach this phenomenon is the study of rare transitions Markov chains. For Metropolis chains associated with Statistical…
Fluids confined to quasi-one-dimensional channels exhibit a dynamic crossover from single file diffusion to normal diffusion as the channel becomes wide enough for particles to hop past each other. In the crossover regime, where hopping…
We investigate the condensation phase transitions of conserved-mass aggregation (CA) model on weighted scale-free networks (WSFNs). In WSFNs, the weight $w_{ij}$ is assigned to the link between the nodes $i$ and $j$. We consider the…
We study an interacting box-particle system on a one-dimensional periodic ring involving two species of particles $A$ and $B$. In this model, from a randomly chosen site, a particle of species $A$ can hop to its right neighbor with a rate…
The motivation of this work is to extend the techniques of higher order random walks on simplicial complexes to analyze mixing times of Markov chains for combinatorial problems. Our main result is a sharp upper bound on the second…
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…
We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both types diffuse as simple random walks with possibly…
Let f be a chain mixing continuous onto mapping from the Cantor set onto itself. Let g be a homeomorphism on the Cantor set that is topologically conjugate to a subshift. Then, homeomorphisms that are topologically conjugate to g…
The probability distribution of the proper delay times during scattering on a chaotic system is derived in the framework of the random matrix approach and the supersymmetry method. The result obtained is valid for an arbitrary number of…
We consider the distribution of waiting times between non-interacting fermions on a tight-binding chain. We calculate the waiting time distribution for a quantum point contact and find a cross-over from Wigner-Dyson statistics at full…
Low-dimensional dynamical systems are fruitful models for mixing in fluid and granular flows. We study a one-dimensional discontinuous dynamical system (termed "cutting and shuffling" of a line segment), and we present a comprehensive…
We prove that a uniformized variant of both the Rosenthal walk \cite{Rosenthal} and the Kac random walk \cite{Kac} on SO(n) mixes in $\cO(n^3)$ steps in total variation distance. The proof also extends easily to Rosenthal walk with fixed…
The antiferromagnetic quantum Ising chain has a quantum critical point which belongs to the universality class of the transverse Ising model (TIM). When a longitudinal field ($h$) is switched on, the phase transition is preserved, which…
We consider the performance of Glauber dynamics for the random cluster model with real parameter $q>1$ and temperature $\beta>0$. Recent work by Helmuth, Jenssen and Perkins detailed the ordered/disordered transition of the model on random…
A discrete-time Markov chain can be transformed into a new Markov chain by looking at its states along iterations of an almost surely finite stopping time. By the optional stopping theorem, any bounded harmonic function with respect to the…
In this paper we consider three classes of interacting particle systems on $\mathbb Z$: independent random walks, the exclusion process, and the inclusion process. We allow particles to switch their jump rate (the rate identifies the type…
We establish a connection between generalised commuting schemes $C_g(U_n)$ of higher genus $g$, which are associated with a group scheme $U_n$ consisting of upper triangular unipotent matrices, and the representation homology…
Define $(X_n)$ on $\mathbf{Z}/q\mathbf{Z}$ by $X_{n+1} = 2X_n + b_n$, where the steps $b_n$ are chosen independently at random from $-1, 0, +1$. The mixing time of this random walk is known to be at most $1.02 \log_2 q$ for almost all odd…
This paper is concerned with random walks on a family of dyadic-valued solvable matrix groups. A description of the Poisson boundary of these groups for probability measures of finite first moment and non-zero displacements (or drifts) is…
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…