Related papers: Cutting and Shuffling a Line Segment: Mixing by In…
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…
For almost all interval exchange maps T_0, with combinatorics of genus g>=2, we construct affine interval exchange maps T which are semi-conjugate to T_0 and have a wandering interval.
We study the time that the simple exclusion process on the complete graph needs to reach equilibrium in terms of total variation distance. For the graph with n vertices and 1<<k<n/2 particles we show that the mixing time is of order…
In the present work, a new time-dependent exchange theory is presented wherein the symmetry constraints, on a multi-electron wavefunction, are properly accounted for. In so doing, the equations of motion, incorporating the required…
Effective medium theory of transport in disordered systems, whose basis is the replacement of spatial disorder by temporal memory, is extended in several practical directions. Restricting attention to a 1-dimensional system with bond…
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…
We study the ergodic properties of compositions of interval exchange transformations and rotations. We show that for any interval exchange transformation T, there is a full measure set of \alpha in [0, 1) so that T composed with R_{\alpha}…
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of 3-loops (triangles). We find that such ensembles generally exhibit two transitions, a clustering…
One way to analyze complicated non-autonomous flows is through trying to understand their transport behavior. In a quantitative, set-oriented approach to transport and mixing, finite time coherent sets play an important role. These are…
We use numerical simulations to examine two-dimensional particle mixtures that strongly phase separate in equilibrium. When the system is externally driven in the presence of quenched disorder, plastic flow occurs in the form of meandering…
Mixing between two different miscible fluids with a mutual interface must be initiated by fluid transporting across this fluid interface, caused for example by applying an unsteady velocity agitation. In general, there is no necessity for…
We consider the exclusion process on segments of the integers in a site-dependent random environment. We assume to be in the ballistic regime in which a single particle has positive linear speed. Our goal is to study the mixing time of the…
Interval linear programming provides a tool for solving real-world optimization problems under interval-valued uncertainty. Instead of approximating or estimating crisp input data, the coefficients of an interval program may perturb…
Space-time varying media with moving interfaces unlock new ways to manipulate electromagnetic waves. Yet, analytical solutions have been mostly limited to interfaces moving at constant velocity or constant proper acceleration. Here, we…
We study finite-time mixing in time-periodic open flow systems. We describe the transport of densities in terms of a transfer operator, which is represented by the transition matrix of a finite-state Markov chain. The transport processes in…
There exist uniquely ergodic affine interval exchange transformations of [0,1] with flips having wandering intervals and such that the support of the invariant measure is a Cantor set.
Monotonic surfaces spanning finite regions of $Z^d$ arise in many contexts, including DNA-based self-assembly, card-shuffling and lozenge tilings. One method that has been used to uniformly generate these surfaces is a Markov chain that…
The analysis of wave patterns in a structure which possesses periodicity in the spatial and temporal dimensions is presented. The topic of imperfect chiral interfaces is also considered. Although causality is fundamental for physical…
In a series of recent works, Boyd, Diaconis, and their co-authors have introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary distribution.…
We study online interval scheduling in the irrevocable setting, where each interval must be immediately accepted or rejected upon arrival. The objective is to maximize the total length of accepted intervals while ensuring that no two…