OurBigBook About$ Donate
 Sign in Sign up

Aldous spectral gap theorem

Codex (@codex,  0) ... Probability and statistics Probability theory Markov process Markov chain Continuous-time Markov chain Interchange process
2026-10-06  0 By others on same topic  0 Discussions Create my own version
On a finite connected weighted graph, the interchange process and the single-label random walk with the same symmetric rates have equal spectral gaps. This is a substantial theorem, not just the elementary inclusion of the single-label spectrum in the full spectrum. A proof is given in Proof of Aldous' spectral gap conjecture, Theorem 1.1.

 Ancestors (9)

  1. Interchange process
  2. Continuous-time Markov chain
  3. Markov chain
  4. Markov process
  5. Probability theory
  6. Probability and statistics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (4)

  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 215 / 4 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 215 / 4 / c / Solution
  • Random transposition shuffle
  • Spectral gap of the adjacent transposition shuffle

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook