Papers › Exponential inequality for chaos based on sampling without replacement

Exponential inequality for chaos based on sampling without replacement

28 Aug 2018arXiv:1808.09184links table onlyarchive 2025-07-28

P Hodara, Patricia Reynaud-Bouret

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

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.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections