Proof of Aldous’ spectral gap conjecture

From MaRDI portal
Publication:3584366

DOI10.1090/S0894-0347-10-00659-4zbMATH Open1203.60145arXiv0906.1238WikidataQ122984871 ScholiaQ122984871MaRDI QIDQ3584366FDOQ3584366

Thomas Richthammer, Thomas M. Liggett, Pietro Caputo

Publication date: 27 August 2010

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0906.1238





Cites Work


Cited In (57)






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)