Abstract: Aldous' spectral gap conjecture asserts that on any graph the random walk process and the random transposition (or interchange) process have the same spectral gap. We prove the conjecture using a recursive strategy. The approach is a natural extension of the method already used to prove the validity of the conjecture on trees. The novelty is an idea based on electric network reduction, which reduces the problem to the proof of an explicit inequality for a random transposition operator involving both positive and negative rates. The proof of the latter inequality uses suitable coset decompositions of the associated matrices on permutations.
Recommendations
- Interlacings for random walks on weighted graphs and the interchange process
- Spectral gap for the interchange process in a box
- A version of Aldous' spectral-gap conjecture for the zero range process
- A few remarks on the octopus inequality and Aldous' spectral gap conjecture
- The spectrum and convergence rates of exclusion and interchange processes on the complete graph
Cites work
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- Cayley graphs on the symmetric group generated by initial reversals have unit spectral gap
- Comparison theorems for reversible Markov chains
- Generating a random permutation with random transpositions
- Interlacings for random walks on weighted graphs and the interchange process
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- On the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions
- Probability on trees and networks
- Random shuffles and group representations
- Random walks on trees and matchings
- Rate of convergence for shuffling cards by transpositions
- Spectral gap for the interchange process in a box
- Strong stationary times via a new form of duality
- The spectral gap of the ferromagnetic \(XXZ\) chain
Cited in
(76)- Essentially tight bounds for rainbow cycles in proper edge-colourings
- Mixing time for the asymmetric simple exclusion process in a random environment
- Ordering the representations of S_n using the interchange process
- Typical and extremal aspects of friends-and-strangers graphs
- Spectral gap for multi-species exclusion processes
- Counterexamples to ferromagnetic ordering of energy levels
- Entropy and curvature: beyond the Peres-Tetali conjecture
- scientific article; zbMATH DE number 7662445 (Why is no real title available?)
- Free energy asymptotics of the quantum Heisenberg spin chain
- The moving particle lemma for the exclusion process on a weighted graph
- A few remarks on the octopus inequality and Aldous' spectral gap conjecture
- Sharp phase transition in the random stirring model on trees
- Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations
- The second eigenvalue of some normal Cayley graphs of highly transitive groups
- On the spectra of token graphs of cycles and other graphs
- On the spectra and spectral radii of token graphs
- Universality of cutoff for exclusion with reservoirs
- Some bounds on the Laplacian eigenvalues of token graphs
- On the spectral gap of some Cayley graphs on the Weyl group \(W(B_n)\)
- Eigenvalues of Cayley graphs
- Friends and strangers walking on graphs
- On the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions
- Dynamics of pseudoentanglement
- The second largest eigenvalues of some Cayley graphs on alternating groups
- Diffusive scaling of the Kob-Andersen model in \({\mathbb{Z}}^d \)
- Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
- Stochastic models for large interacting systems and related correlation inequalities
- A proof of alon's second eigenvalue conjecture
- Aldous's spectral gap conjecture for normal sets
- On the dynamical behavior of the ABC model
- On the algebraic connectivity of some token graphs
- Comparing with octopi
- Validity of the spin-wave approximation for the free energy of the Heisenberg ferromagnet
- Spectral gap for random-to-random shuffling on linear extensions
- Rates of convergence to equilibrium for potlatch and smoothing processes
- Garland's method for token graphs
- Violation of ferromagnetic ordering of energy levels in spin rings for the singlet
- On the diameters of friends-and-strangers graphs
- Spectral gap of the symmetric inclusion process
- The full spectrum of random walks on complete finite \(d\)-ary trees
- A version of Aldous' spectral-gap conjecture for the zero range process
- Laplacian spectral radius and integrality of token graphs
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- The second largest eigenvalue of some nonnormal Cayley graphs on symmetric groups
- Interacting particle systems as stochastic social dynamics
- Spectral gap for the interchange process in a box
- Ferromagnetic ordering of energy levels for \(\mathrm{U}_q(\mathfrak{sl}_2)\) symmetric spin chains
- The exclusion process mixes (almost) faster than independent particles
- On the treewidth of token and Johnson graphs
- The analogue of Aldous’ spectral gap conjecture for the generalized exclusion process
- The spectrum and convergence rates of exclusion and interchange processes on the complete graph
- Coxeter factorizations with generalized Jucys–Murphy weights and Matrix‐Tree theorems for reflection groups
- The probability of long cycles in interchange processes
- Proof of the fundamental gap conjecture
- Spectral analysis of random-to-random Markov chains
- Quartic graphs with minimum spectral gap
- A general method to find the spectrum and eigenspaces of the k-token graph of a cycle, and 2-token through continuous fractions
- Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022
- Optimizing the convergence rate of the quantum consensus: a discrete-time model
- Interlacings for random walks on weighted graphs and the interchange process
- Mixing of the averaging process and its discrete dual on finite-dimensional geometries
- Approach to equilibrium for random walks on graphs and for stochastic infinite particle processes
- Mixing time and cutoff for the k-SPEP
- Cutoff for rewiring dynamics on perfect matchings
- A sharp log-Sobolev inequality for the multislice
- Comparison inequalities and fastest-mixing Markov chains
- Convergence to equilibrium for a directed (1+d)-dimensional polymer
- On meteors, earthworms and wimps
- The interchange process on high-dimensional products
- Aldous' spectral gap property for normal Cayley graphs on symmetric groups
- On the algebraic connectivity of token graphs and graphs under perturbations
- Mixing times for exclusion processes on hypergraphs
- Mixing time and cutoff for one-dimensional particle systems
- Spectral properties of token graphs
- On the Aldous-Caputo spectral gap conjecture for hypergraphs
- Density fluctuations for exclusion processes with long jumps
This page was built for publication: Proof of Aldous' spectral gap conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584366)
