Stein's Method and Stochastic Analysis of Rademacher Functionals
Dublin Core | PKP Metadata Items | Metadata for this Document | |
1. | Title | Title of document | Stein's Method and Stochastic Analysis of Rademacher Functionals |
2. | Creator | Author's name, affiliation, country | Gesine D Reinert; University of Oxford; United Kingdom |
2. | Creator | Author's name, affiliation, country | Ivan Nourdin; University Pierre et Marie Curie (Paris VI); France |
2. | Creator | Author's name, affiliation, country | Giovanni Peccati; University Paris Ouest - Nanterre; France |
3. | Subject | Discipline(s) | |
3. | Subject | Keyword(s) | Central Limit Theorems; Discrete Malliavin operators; Normal approximation; Rademacher sequences; Sparse sets; Stein's method; Walsh chaos. |
3. | Subject | Subject classification | 60F05; 60F99; 60G50; 60H07. |
4. | Description | Abstract | We compute explicit bounds in the Gaussian approximation of functionals of infinite Rademacher sequences. Our tools involve Stein's method, as well as the use of appropriate discrete Malliavin operators. As the bounds are given in terms of Malliavin operators, no coupling construction is required. When the functional depends only on the first d coordinates of the Rademacher sequence, a simple sufficient condition for convergence to a normal distribution is derived. For finite quadratic forms, we obtain necessary and sufficient conditions. Although our approach does not require the classical use of exchangeable pairs, when the functional depends only on the first d coordinates of the Rademacher sequence we employ chaos expansion in order to construct an explicit exchangeable pair vector; the elements of the vector relate to the summands in the chaos decomposition and satisfy a linearity condition for the conditional expectation. Among several examples, such as random variables which depend on infinitely many Rademacher variables, we provide three main applications: (i) to CLTs for multilinear forms belonging to a fixed chaos, (ii) to the Gaussian approximation of weighted infinite 2-runs, and (iii) to the computation of explicit bounds in CLTs for multiple integrals over sparse sets. This last application provides an alternate proof (and several refinements) of a recent result by Blei and Janson. |
5. | Publisher | Organizing agency, location | |
6. | Contributor | Sponsor(s) | Institute of Mathematical Sciences of the National University of Singapore |
7. | Date | (YYYY-MM-DD) | 2010-11-03 |
8. | Type | Status & genre | Peer-reviewed Article |
8. | Type | Type | |
9. | Format | File format | |
10. | Identifier | Uniform Resource Identifier | http://ejp.ejpecp.org/article/view/823 |
10. | Identifier | Digital Object Identifier | 10.1214/EJP.v15-823 |
11. | Source | Journal/conference title; vol., no. (year) | Electronic Journal of Probability; Vol 15 |
12. | Language | English=en | |
14. | Coverage | Geo-spatial location, chronological period, research sample (gender, age, etc.) | |
15. | Rights | Copyright and permissions | The Electronic Journal of Probability applies the Creative Commons Attribution License (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available. Summary of the Creative Commons Attribution License You are free
|