Proof of Aldous' spectral gap conjecture

Details Proof of Aldous' spectral gap conjecture Proof of Aldous' spectral gap conjecture

2009-06-06

arxiv.org/abs/0906.1238v4

J. Amer. Math. Soc. 23 (2010), 831-851

Mathematics

Probability

23 pages, 7 figures. Revised version, minor changes

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Proof of Aldous' spectral gap conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Proof of Aldous' spectral gap conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof of Aldous' spectral gap conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-61906