相关论文: Limit Profiles for Separation Distance
The random transposition shuffle on repeated cards induces a Markov chain on the quotient space of arrangements with multiplicities, and is equivalent to the many-urn mean-field Bernoulli-Laplace model introduced by Scarabotti. Writing…
We investigate the $k$-cycle shuffle on repeated cards, namely on a deck consisting of $l$ identical copies of each of $m$ card types, with total size $n=ml$. We establish asymptotic results for the total variation mixing of this shuffle,…
In a recent breakthrough, Teyssier [Tey20] introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profile for the random transpositions card shuffle. His techniques…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
We present an improved version of Diaconis' upper bound lemma, which is used to compute the limiting value of the distance to stationarity. We then apply it to random transpositions studied by Diaconis and Shahshahani.
The Hausdorff distance is a measure of (dis-)similarity between two sets which is widely used in various applications. Most of the applied literature is devoted to the computation for sets consisting of a finite number of points. This has…
Maximum distance profile codes are characterized by the property that two trajectories which start at the same state and proceed to a different state will have the maximum possible distance from each other relative to any other…
We find Gaussian cutoff profiles for the total variation distance to stationarity of a random walk on a multiplex network: a finite number of directed configuration models sharing a vertex set, each with its own bounded degree distribution…
We study the asymmetric simple exclusion process (ASEP) on a segment $\{1,\ldots,b_N\}$ and are interested in its total variation distance to equilibrium when started from an initial configuration $\xi^{N}$. We provide a general result…
We introduce a new type of card shuffle called one-sided transpositions. At each step a card is chosen uniformly from the pack and then transposed with another card chosen uniformly from below it. This defines a random walk on the symmetric…
We present an overview of the representation theoretic techniques used to study the mixing times of random walks on finite groups. We focus on the card shuffle studied by Diaconis and Shahshahani in the 1980s and a recent improvement on…
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…
We study deformations of the Plancherel measure of the symmetric group by lifting them to the symmetric group and using combinatorics of card shuffling. The existing methods for analyzing deformations of Plancherel measure are not obviously…
We consider the Metropolis biased card shuffling (also called the multi-species ASEP on a finite interval or the random Metropolis scan). Its convergence to stationary was believed to exhibit a total-variation cutoff, and that was proved a…
We provide a brief tutorial on the use of concentration inequalities as they apply to system identification of state-space parameters of linear time invariant systems, with a focus on the fully observed setting. We draw upon tools from the…
The well-known Gilbert-Shannon-Reeds model for riffle shuffles assumes that the cards are initially cut 'about in half' and then riffled together. We analyze a natural variant where the initial cut is biased. Extending results of Fulman…
We give lower and upper bounds for the separation profile (introduced by Benjamini, Schramm & Tim\'ar) for various graphs using the isoperimetric profile, growth and Hilbertian compression. For graphs which have polynomial isoperimetry and…
This article gives sharp estimates for the mixing time of the Burnside process for Sylow $p$-double cosets in the symmetric group $S_n$. This process is a Markov chain on $S_n$ which can be used to uniformly sample Sylow $p$-double cosets.…
We investigate a quadratic dynamical system known as nonlinear recombinations. This system models the evolution of a probability measure over the Boolean cube, converging to the stationary state obtained as the product of the initial…
We present a versatile setup for investigating the nanofluidic behavior of nanoparticles as a function of the gap distance between two confining surfaces. The setup is designed as an open system which operates with small amounts of…