2000 character limit reached
Bounds of the remainder in a combinatorial central limit theorem (1405.1670v1)
Published 7 May 2014 in math.PR
Abstract: We derive new bounds of the remainder in a combinatorial central limit theorem without assumptions on independence and existence of moments of summands. For independent random variables our theorems imply Esseen and Berry-Esseen type inequalities, some other new bounds and a combinatorial central limit theorem in the case of infinite variations.
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.