Mixing times of the biased card shuffling and the asymmetric exclusion process
From MaRDI portal
Publication:4671890
DOI10.1090/S0002-9947-05-03610-XzbMath1071.60095arXivmath/0207199MaRDI QIDQ4671890
Elchanan Mossel, Noam Berger, Itai Benjamini, Christopher Hoffmann
Publication date: 27 April 2005
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0207199
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items
Cutoff profile of ASEP on a segment, Mixing times for the simple exclusion process in ballistic random environment, Mixing time and cutoff for the weakly asymmetric simple exclusion process, Some things we've learned (about Markov chain Monte Carlo), Comparison inequalities and fastest-mixing Markov chains, Phase uniqueness for the Mallows measure on permutations, \(q\)-exchangeability via quasi-invariance, Mallows permutations and finite dependence, Mixing times of Markov chains for self‐organizing lists and biased permutations, Cycles in Mallows random permutations, Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling, Mixing times for the simple exclusion process with open boundaries, Mixing time and cutoff for one-dimensional particle systems, Mixing time for the asymmetric simple exclusion process in a random environment, Rejoinder: ``Gibbs sampling, exponential families and orthogonal polynomials, Cutoff profile of the metropolis biased card shuffling, The two-sided infinite extension of the Mallows model for random permutations, Limit theorems for longest monotone subsequences in random Mallows permutations, Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations, Unnamed Item, Sorting by swaps with noisy comparisons, \( \text{GUE}\times \text{GUE}\) limit law at hard shocks in ASEP, On the cycle structure of Mallows permutations, Mixing of the exclusion process with small bias, Thermodynamic limit for the Mallows model on Sn, The stationary measure of a 2-type totally asymmetric exclusion process., Systematic scan for sampling colorings, The mixing time for simple exclusion, Sampling and Counting 3-Orientations of Planar Triangulations, Dynamical phase transition of ASEP in the KPZ regime, The height of Mallows trees, Sampling biased monotonic surfaces using exponential metrics, The oriented swap process, Mixing of permutations by biased transpositions, KPZ statistics of second class particles in ASEP via mixing, Markov chains, ${\mathscr R}$-trivial monoids and representation theory, Metastability for expanding bubbles on a sticky substrate, Mallows permutations as stable matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Central limit theorems for infinite series of queues and applications to simple exclusion
- From shuffling cards to walking around the building: An introduction to modern Markov chain theory
- Trailing the dovetail shuffle to its lair
- What do we know about the Metropolis algorithm?
- Mixing times of lozenge tiling and card shuffling Markov chains
- Coordinate selection rules for Gibbs sampling
- Light bullets and optical collapse in vacuum
- Shuffling Cards and Stopping Times
- Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
