Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Exponential inequality for chaos based on sampling without replacement (1808.09184v1)

Published 28 Aug 2018 in math.ST, math.PR, and stat.TH

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.

Summary

We haven't generated a summary for this paper yet.