Interlacings for random walks on weighted graphs and the interchange process

Abstract

We study Aldous' conjecture that the spectral gap of the interchange process on a weighted undirected graph equals the spectral gap of the random walk on this graph. We present a conjecture in the form of an inequality, and prove that this inequality implies Aldous' conjecture by combining an interlacing result for Laplacians of random walks on weighted graphs with representation theory. We prove the conjectured inequality for several important instances. As an application of the developed theory, we prove Aldous' conjecture for a large class of weighted graphs, which includes all wheel graphs, all graphs with four vertices, certain nonplanar graphs, certain graphs with several weighted cycles of arbitrary length, as well as all trees. Caputo, Liggett, and Richthammer have recently resolved Aldous' conjecture, after independently and simultaneously discovering the key ideas developed in the present paper.

References in corpus (1)

• Interlacings for random walks on weighted graphs and the interchange process

Cited by in corpus (9)

• Proof of Aldous' spectral gap conjecture
• Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
• Interlacings for random walks on weighted graphs and the interchange process
• Exact eigenspectrum of the symmetric simple exclusion process on the complete, complete bipartite, and related graphs
• Aldous' spectral gap property for normal Cayley graphs on symmetric groups
• Spectral analysis of random-to-random Markov chains
• Ordering the representations of S_n using the interchange process
• Asymptotic Ferromagnetic Ordering of Energy Levels for the Heisenberg Model on Large Boxes
• On the spectral gap of some Cayley graphs on the Weyl group $W(B_n)$