Abstract
<!-- *** Custom HTML *** --> Let $W(\pi)$ be either the number of descents or inversions of a permutation $\pi \in S_n$. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
