The interchange process on high-dimensional products
From MaRDI portal
Publication:2240808
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Continuous-time Markov processes on discrete state spaces (60J27)
Abstract: We resolve a long-standing conjecture of Wilson (2004), reiterated by Oliveira (2016), asserting that the mixing-time of the unit-rate Interchange Process on the -dimensional hypercube is of order . This follows from a sharp inequality established at the level of Dirichlet forms, from which we also deduce that macroscopic cycles emerge in constant time, and that the log-Sobolev constant of the exclusion process is of order . Beyond the hypercube, our results apply to cartesian products of arbitrary graphs of fixed size, shedding light on a broad conjecture of Oliveira (2013).
Recommendations
- The random interchange process on the hypercube
- Cycle structure of the interchange process and representation theory
- The contact process in high dimensions
- The interchange process with reversals on the complete graph
- scientific article; zbMATH DE number 1735434
- Improved Product-Based High-Dimensional Expanders
- The probability of long cycles in interchange processes
- The research of dynamical properties of the product space
- Inference for High-Dimensional Exchangeable Arrays
Cites work
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 1236226 (Why is no real title available?)
- scientific article; zbMATH DE number 1350307 (Why is no real title available?)
- scientific article; zbMATH DE number 2046051 (Why is no real title available?)
- A version of Aldous' spectral-gap conjecture for the zero range process
- Comparing with octopi
- Comparison theorems for reversible Markov chains
- Compositions of random transpositions
- Cycle structure of the interchange process and representation theory
- Emergence of giant cycles and slowdown transition in random transpositions and \(k\)-cycles
- Generating a random permutation with random transpositions
- Improved lower bound on thermodynamic pressure of the spin 1/2 Heisenberg ferromagnet
- Interacting particle systems at Saint-Flour
- Logarithmic Sobolev inequalities for finite Markov chains
- Logarithmic Sobolev inequality for generalized simple exclusion processes
- Logarithmic Sobolev inequality for some models of random walks
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- Mixing times for the interchange process
- Mixing times of lozenge tiling and card shuffling Markov chains
- Phase transition for the interchange and quantum Heisenberg models on the Hamming graph
- Proof of Aldous' spectral gap conjecture
- Sharp phase transition in the random stirring model on trees
- The cutoff phenomenon in finite Markov chains.
- The exclusion process mixes (almost) faster than independent particles
- The probability of long cycles in interchange processes
- The random interchange process on the hypercube
Cited in
(7)- Many-body quantum systems. Abstracts from the workshop held September 10--15, 2023
- Spectral gap for the interchange process in a box
- A sharp log-Sobolev inequality for the multislice
- On the diameters of friends-and-strangers graphs
- Sensitivity of mixing times of Cayley graphs
- Existence of a phase transition of the interchange process on the Hamming graph
- Mixing time and cutoff for one-dimensional particle systems
This page was built for publication: The interchange process on high-dimensional products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2240808)