OurBigBook About$ Donate
 Sign in Sign up

Random transposition shuffle

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Probability theory Markov process Markov chain
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Choose two positions independently and uniformly from {1,…,n} and swap them. This Markov chain on the symmetric group holds with probability 1/n and assigns probability 2/n2 to each unordered transposition. Its stationary distribution is uniform, and its ordinary spectral gap is 2/n for n≥2. The latter follows from the Aldous spectral gap theorem: the single-label continuous-time Markov chain has rate 2/n2 between every pair of positions, whose mean-zero eigenvalues are all −2/n.

 Ancestors (7)

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

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 215 / 4 / c / Solution

 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