Related papers: Cutting and Shuffling a Line Segment: Mixing by In…
Interval exchange transformations are typically uniquely ergodic maps and therefore have uniformly distributed orbits. Their degree of uniformity can be measured in terms of the star-discrepancy. Few examples of interval exchange…
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 examine the dynamics of cutting-and-shuffling a hemispherical shell driven by alternate rotation about two horizontal axes using the framework of piecewise isometry (PWI) theory. Previous restrictions on how the domain is…
A shift-periodic map is a one-dimensional map from the real line to itself which is periodic up to a linear translation and allowed to have singularities. It is shown that iterative sequences $x_{n+1}=F(x_n)$ generated by such maps display…
The problem of efficiently sampling from a set of(undirected) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the sampling. The…
We investigate the mixing properties of a finite Markov chain in random environment defined as a mixture of a deterministic chain and a chain whose state space has been permuted uniformly at random. This work is the counterpart of a…
Transitive consistency is an intrinsic property for collections of linear invertible transformations between Euclidean coordinate frames. In practice, when the transformations are estimated from data, this property is lacking. This work…
We study the convergence rate to stationarity for a class of exchangeable partition-valued Markov chains called cut-and-paste chains. The law governing the transitions of a cut-and-paste chain are determined by products of i.i.d. stochastic…
We survey recent results concerning the total-variation mixing time of the simple exclusion process on the segment (symmetric and asymmetric) and a continuum analog, the simple random walk on the simplex with an emphasis on cutoff results.…
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…
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We further study…
We prove that any over-twist pattern is conjugate to an interval exchange transformation with bounded number of segments of isometry, restricted on one of its cycles. The bound is independent of the period and over-rotation number of the…
We study a stochastic model based on a modified fragmentation of a finite interval. The mechanism consists in cutting the interval at a random location and substituting a unique fragment on the right of the cut to regenerate and preserve…
A perturbed family of interval exchange maps (FIEMs) provides a natural two-\linebreak{}dimensional area-preserving extension of interval exchange maps, with each IEM parameterized by an action variable $y$. Such families arise, for…
We refine upper bounds on the permanent saturation time of metric graphs using interval exchange transformations (IETs). Earlier results gave bounds under incommensurable edge lengths, we improve and generalize them by using the ergodic and…
We consider the effect on the mixing properties of a piecewise smooth interval map $f$ when its domain is divided into $N$ equal subintervals and $f$ is composed with a permutation of these. The case of the stretch-and-fold map $f(x)=mx…
This article provides the first procedure for computing a fully data-dependent interval that traps the mixing time $t_{\text{mix}}$ of a finite reversible ergodic Markov chain at a prescribed confidence level. The interval is computed from…
Consider the following method of card shuffling. Start with a deck of $N$ cards numbered 1 through N. Fix a parameter $p$ between 0 and 1. In this model a ``shuffle'' consists of uniformly selecting a pair of adjacent cards and then…
In this article, we prove the cutoff phenomenon for a general class of the discrete-time nonlinear recombination models. This system models the evolution of a probability measure on a finite product space $S^n$ representing the state of…
We study sequences of partitions of a non decreasing sequence I n of intervals into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according…