Pith. sign in

REVIEW 1 cited by

A Note on Concentration Inequalities for U-Statistics

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1712.06160 v2 pith:5HAUOKVX submitted 2017-12-17 math.ST stat.TH

A Note on Concentration Inequalities for U-Statistics

Yannik Pitcan This is my paper
classification math.ST stat.TH
keywords concentrationinequalitiesu-statisticsproofsresultsalthoughboundsclassical
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The aim of this paper is to discuss various concentration inequalities for U-statistics and most recent results. A special focus will be on providing proofs for bounds on the U-statistics using classical concentration inequalities, which, although the results well known, the proofs are not found in the literature.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Concentration Inequalities for Incomplete U-statistics over Arbitrary Sampling Graphs

    math.PR 2026-07 conditional novelty 6.0

    Graph-indexed pairwise sums of kernels concentrate at a sub-Gaussian rate governed by total variance and the graph's chromatic index, with extensions to hypergraphs and doubly indexed data.