Proof of Aldous’ spectral gap conjecture

A well known conjecture asserts that on any graph the random walk and the interchange process have the same spectral gap.
I will present recent work in collaboration with T.M. Liggett and T. Richthammer, in which we prove the conjecture using a recursive strategy. The main novelty is an idea based on electric network reduction, which allows us to reduce the problem to the proof of a
new comparison inequality between certain weighted graphs.

Speaker Details

Pietro Caputo is a Professor at Universita Roma Tre (Rome, Italy). He obtained his PhD at Technische Universitaet Berlin in the year 2000. He has held since then

various visiting positions including a one year professorship at University of California, Los Angeles.

Date:
Speakers:
Pietro Caputo
Affiliation:
Universita Roma Tre
    • Portrait of Jeff Running

      Jeff Running