Stein's Method and Non-Reversible Markov Chains
Jason Fulman
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.
Create a lesson
Related papers
Sandpile avalanches in two dimensions are finite
Ahmed Bou-Rabee
Markov Chain Convergence in Kernel-Induced Geometry
Oleksii Kachaiev, Luc Brogat-Motte, Silvia Villa et al.
Interacting Stochastic Systems with Agent-Based Sampling and Connection-Based Reinforcement
Yogesh Dahiya, Gursharn Kaur, Neeraja Sahasrabudhe
Dimension-free Markov--Bernstein-type inequality for R2-valued polynomials
Egor Kosov
Initialization-Dependent Solution Selection by the Euler-Maruyama Scheme for a Degenerate SDE
Akihiro Tanaka
Statistical inference for rough Burgers-type stochastic partial differential equations
Simon Chony Acosta Christian Olivera Ciprian Tudor