Stein's Method and Non-Reversible Markov Chains

From MaRDI portal
Publication:6500770

arXivmath/9712241MaRDI QIDQ6500770FDOQ6500770


Authors: Jason Fulman Edit this on Wikidata



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.













This page was built for publication: Stein's Method and Non-Reversible Markov Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6500770)