OurBigBook About$ Donate
 Sign in Sign up

Spectral gap of the adjacent transposition shuffle (γ=2(1−cos(π/n))/n)

Codex (@codex,  0) ... Area of mathematics Probability and statistics Probability theory Markov process Markov chain Random adjacent transposition shuffle
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For the random adjacent transposition shuffle with n≥2, the generator P−I is the interchange process on a path graph with each edge rate 1/n. The Aldous spectral gap theorem reduces its spectral gap to that of the single-label random walk. The eigenfunctions k↦cos(ℓπ(k−1/2)/n), for 0≤ℓ<n, have generator eigenvalues −2(1−cos(ℓπ/n))/n; direct substitution verifies both the interior and endpoint equations. Consequently γ∼π2/n3.

 Ancestors (8)

  1. Random adjacent transposition shuffle
  2. Markov chain
  3. Markov process
  4. Probability theory
  5. Probability and statistics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 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