2000 character limit reached
Normal approximation and almost sure central limit theorem for non-symmetric Rademacher functionals
Published 15 Mar 2016 in math.PR | (1603.04661v2)
Abstract: In this work, we study the normal approximation and almost sure central limit theorems for some functionals of an independent sequence of Rademacher random variables. In particular, we provide a new chain rule that improves the one derived by Nourdin, Peccati and Reinert(2010) and then we deduce the bound on Wasserstein distance for normal approximation using the (discrete) Malliavin-Stein approach. Besides, we are able to give the almost sure central limit theorem for a sequence of random variables inside a fixed Rademacher chaos using the Ibragimov-Lifshits criterion.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.