Stein's Method and Non-Reversible Markov Chains
Abstract
Let W be either the number of descents or inversions of a permutation. Stein's method is applied to show that W satisfies a central limit theorem with error rate n(-1/2). The construction of an exchangeable pair (W,W') used in Stein's method is non-trivial and uses a non-reversible Markov chain.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.