Stein's Method and Non-Reversible Markov Chains
| dc.creator | Fulman, Jason | |
| dc.date | 1997-12-09 | |
| dc.date | 2004-08-17 | |
| dc.date.accessioned | 2026-07-07T05:23:24Z | |
| dc.date.available | 2026-07-07T05:23:24Z | |
| dc.description | 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. | |
| dc.description | 9 pages; final version appearing in IMS Lecture Notes, Volume 46 "Stein's Method: Expository Lectures and Applications". Change in title, slightly better bounds and exposition, updated bibliography | |
| dc.identifier | https://arxiv.org/abs/math/9712241 | |
| dc.identifier | http://arxiv.org/abs/math/9712241 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/76421 | |
| dc.subject | Probability | |
| dc.subject | Combinatorics | |
| dc.subject | 60F05;20B30 | |
| dc.title | Stein's Method and Non-Reversible Markov Chains | |
| dc.type | text |