Proof of Aldous' spectral gap conjecture
From MaRDI portal
Publication:3584366
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
(64)- Spectral gap of the symmetric inclusion process
- On the spectra and spectral radii of token graphs
- Universality of cutoff for exclusion with reservoirs
- On the algebraic connectivity of some token graphs
- A general method to find the spectrum and eigenspaces of the \(k\)-token graph of a cycle, and 2-token through continuous fractions
- On the diameters of friends-and-strangers graphs
- Garland's method for token graphs
- Cutoff for rewiring dynamics on perfect matchings
- Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022
- Mixing time for the asymmetric simple exclusion process in a random environment
- Mixing time and cutoff for one-dimensional particle systems
- Spectral properties of token graphs
- Validity of the spin-wave approximation for the free energy of the Heisenberg ferromagnet
- Stochastic models for large interacting systems and related correlation inequalities
- Proof of the fundamental gap conjecture
- A few remarks on the octopus inequality and Aldous' spectral gap conjecture
- Mixing of the averaging process and its discrete dual on finite-dimensional geometries
- Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations
- Interacting particle systems as stochastic social dynamics
- The full spectrum of random walks on complete finite \(d\)-ary trees
- The second eigenvalue of some normal Cayley graphs of highly transitive groups
- scientific article; zbMATH DE number 7662445 (Why is no real title available?)
- Ordering the representations of \(S_n\) using the interchange process
- Free energy asymptotics of the quantum Heisenberg spin chain
- The moving particle lemma for the exclusion process on a weighted graph
- Counterexamples to ferromagnetic ordering of energy levels
- Quartic graphs with minimum spectral gap
- Spectral gap for multi-species exclusion processes
- Rates of convergence to equilibrium for potlatch and smoothing processes
- Optimizing the convergence rate of the quantum consensus: a discrete-time model
- Diffusive scaling of the Kob-Andersen model in \({\mathbb{Z}}^d \)
- Interlacings for random walks on weighted graphs and the interchange process
- Comparing with octopi
- Spectral gap for the interchange process in a box
- A sharp log-Sobolev inequality for the multislice
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- A proof of alon's second eigenvalue conjecture
- Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
- Convergence to equilibrium for a directed \((1+d)\)-dimensional polymer
- On the dynamical behavior of the ABC model
- Aldous's spectral gap conjecture for normal sets
- Density fluctuations for exclusion processes with long jumps
- Comparison inequalities and fastest-mixing Markov chains
- Mixing times for exclusion processes on hypergraphs
- On meteors, earthworms and wimps
- The probability of long cycles in interchange processes
- Sharp phase transition in the random stirring model on trees
- The exclusion process mixes (almost) faster than independent particles
- On the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions
- Spectral analysis of random-to-random Markov chains
- On the spectral gap of some Cayley graphs on the Weyl group \(W(B_n)\)
- Spectral gap for random-to-random shuffling on linear extensions
- Approach to equilibrium for random walks on graphs and for stochastic infinite particle processes
- Aldous' spectral gap property for normal Cayley graphs on symmetric groups
- Ferromagnetic ordering of energy levels for \(\mathrm{U}_q(\mathfrak{sl}_2)\) symmetric spin chains
- The second largest eigenvalues of some Cayley graphs on alternating groups
- The interchange process on high-dimensional products
- The spectrum and convergence rates of exclusion and interchange processes on the complete graph
- Typical and extremal aspects of friends-and-strangers graphs
- Coxeter factorizations with generalized Jucys–Murphy weights and Matrix‐Tree theorems for reflection groups
- On the spectra of token graphs of cycles and other graphs
- A version of Aldous' spectral-gap conjecture for the zero range process
- Friends and strangers walking on graphs
- Eigenvalues of Cayley graphs
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)
