Related papers: The Simple Exclusion Process on the Circle has a d…
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 present an algorithm that computes a shortest non-contractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in O(n \log n) time, where n denotes the complexity of the surface. This solves a…
We study a generalized two-species model on a ring. The original model [1] describes ordinary particles hopping exclusively in one direction in the presence of an impurity. The impurity hops with a rate different from that of ordinary…
Simple exclusion processes for particles moving along two parallel lattices and jumping between them are theoretically investigated for asymmetric rates of transition between the channels. An approximate theoretical approach, that describes…
The cutoff phenomenon was recently shown to systematically follow from non-negative curvature and the product condition, for all Markov diffusions. The proof crucially relied on a classical \emph{chain rule} satisfied by the carr\'e du…
For a discrete time quantum walk (QW) on the $N$-cycle, allowing for decoherence on the coin, we derive a number of new results, including an explicit formula for the position probability distribution. For a QW of this type, we show that…
As the simplest model of transport of interacting particles in a disordered medium, we consider the asymmetric simple exclusion process (ASEP) in which particles with hard-core interactions perform biased random walks, on the supercritical…
We consider "bridges" for the simple exclusion process on Z, either symmetric or asymmetric, in which particles jump to the right at rate p and to the left at rate 1-p. The initial state O has all negative sites occupied and all…
In this paper, we study the biased random transposition shuffle, a natural generalization of the classical random transposition shuffle studied by Diaconis and Shahshahani. We diagonalize the transition matrix of the shuffle and use these…
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The problem of determining the mixing time of the cyclic-to-random…
It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…
We consider the stationary measure of the open asymmetric simple exclusion process (ASEP) with light particles. We prove several results on the asymptotic locations of the light particles under the stationary measure. Moreover, in the fan…
The Symmetric Exclusion Process (SEP), in which particles hop symmetrically on a discrete line with hard-core constraints, is a paradigmatic model of subdiffusion in confined systems. This anomalous behavior is a direct consequence of…
In this paper, we will study the long time behavior of the simple symmetric exclusion process in the ``channel'' $\Lambda_N=[1,N]\cap \mathbb{N}$ with reservoirs at the boundaries. These reservoirs are also systems of particles which can be…
In an exclusion process with avalanches, when a particle hops to a neighboring empty site which is adjacent to an island the particle on the other end of the island immediately hops and if it joins another island this triggers another hop.…
We consider Brownian motion in a circular disk $\Omega$, whose boundary $\p\Omega$ is reflecting, except for a small arc, $\p\Omega_a$, which is absorbing. As $\epsilon=|\partial \Omega_a|/|\partial \Omega|$ decreases to zero the mean time…
The cutoff phenomenon for an ergodic Markov chain describes a sharp transition in the convergence to its stationary distribution, over a negligible period of time, known as cutoff window. We study the cutoff phenomenon for simple random…
In the open circular billiard particles are placed initially with a uniform distribution in their positions inside a planar circular vesicle. They all have velocities of the same magnitude, whose initial directions are also uniformly…
Let $P$ be a set of $n$ points in the plane. In this paper we study a new variant of the circular separability problem in which a point set $P$ is preprocessed so that one can quickly answer queries of the following form: Given a geometric…
Let $G$ be a finite group. The commuting chain on $G$ moves from an element $x$ to $y$ by selecting $y$ uniformly amongst those which commute with $x$. The $t$ step transition probabilities of this chain converge to a distribution uniform…