2000 character limit reached
Exponential inequality for chaos based on sampling without replacement
Published 28 Aug 2018 in math.ST, math.PR, and stat.TH | (1808.09184v1)
Abstract: We are interested in the behavior of particular functionals, in a framework where the only source of randomness is a sampling without replacement. More precisely the aim of this short note is to prove an exponential concentration inequality for special U-statistics of order 2, that can be seen as chaos.
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.