The interchange process on high-dimensional products
From MaRDI portal
Publication:2240808
DOI10.1214/20-AAP1583zbMath1476.60117arXiv1905.02146OpenAlexW3137234033MaRDI QIDQ2240808
Publication date: 4 November 2021
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.02146
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)
Related Items (2)
Mixing time and cutoff for one-dimensional particle systems ⋮ A sharp log-Sobolev inequality for the multislice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- The random interchange process on the hypercube
- The probability of long cycles in interchange processes
- Emergence of giant cycles and slowdown transition in random transpositions and \(k\)-cycles
- Logarithmic Sobolev inequality for some models of random walks
- Comparison theorems for reversible Markov chains
- Logarithmic Sobolev inequality for generalized simple exclusion processes
- Mixing times of lozenge tiling and card shuffling Markov chains
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- Comparing with octopi
- Phase transition for the interchange and quantum Heisenberg models on the Hamming graph
- The exclusion process mixes (almost) faster than independent particles
- A version of Aldous' spectral-gap conjecture for the zero range process
- Sharp phase transition in the random stirring model on trees
- Improved lower bound on thermodynamic pressure of the spin 1/2 Heisenberg ferromagnet
- Compositions of random transpositions
- Logarithmic Sobolev inequalities for finite Markov chains
- Mixing times for the interchange process
- Proof of Aldous’ spectral gap conjecture
- Generating a random permutation with random transpositions
- The cutoff phenomenon in finite Markov chains.
- Cycle structure of the interchange process and representation theory
This page was built for publication: The interchange process on high-dimensional products