Aldous's spectral gap conjecture
For every finite connected weighted graph , the spectral gap of the interchange process on equals the spectral gap of the continuous-time random walk on : , where and denote the respective first nonzero eigenvalues of the generators.
References
Status
- Solved: Pietro Caputo, Thomas M. Liggett, and Fabio Richthammer. Proof of Aldous’ spectral gap conjecture (Journal of the American Mathematical Society, 2010) https://doi.org/10.1090/S0894-0347-10-00659-4
Source: arXiv
Progress summary
The conjecture was settled by a published proof in 2010, and a September 2026 preprint adds an unverified result about one ingredient without changing that conclusion.
Aldous formulated the conjecture around 1992: for every weighted graph, the interchange process and random walk have equal spectral gaps, . Caputo, Liggett, and Richthammer proved it for arbitrary weighted graphs.
Known results
- Caputo, Liggett, and Richthammer, 2009 (published 2010): proved the conjecture for every finite weighted graph, using the octopus inequality.
September 2026 Plücker-positivity development
Submitted September 3, 2026, Haoran Zhu’s preprint claims a positivity theorem for universal Plücker coordinates and connects positivity of a normalized coordinate at a critical specialization with the octopus inequality. It presents related hypergraph inequalities but does not claim a new proof of Aldous’s conjecture; the new claims are unverified.
Current status (as of September 2026): The original conjecture is settled by Caputo, Liggett, and Richthammer; the new strengthening of its octopus-inequality machinery remains unverified.
Solutions 0
No solutions have been posted yet.