Concentration inequalities for order statistics

From MaRDI portal
Publication:742953

DOI10.1214/ECP.V17-2210zbMATH Open1349.60021arXiv1207.7209OpenAlexW3103700089WikidataQ58374454 ScholiaQ58374454MaRDI QIDQ742953FDOQ742953

Stéphane Boucheron, Maud Thomas

Publication date: 22 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: This note describes non-asymptotic variance and tail bounds for order statistics of samples of independent identically distributed random variables. Those bounds are checked to be asymptotically tight when the sampling distribution belongs to a maximum domain of attraction. If the sampling distribution has non-decreasing hazard rate (this includes the Gaussian distribution), we derive an exponential Efron-Stein inequality for order statistics: an inequality connecting the logarithmic moment generating function of centered order statistics with exponential moments of Efron-Stein (jackknife) estimates of variance. We use this general connection to derive variance and tail bounds for order statistics of Gaussian sample. Those bounds are not within the scope of the Tsirelson-Ibragimov-Sudakov Gaussian concentration inequality. Proofs are elementary and combine R'enyi's representation of order statistics and the so-called entropy approach to concentration inequalities popularized by M. Ledoux.


Full work available at URL: https://arxiv.org/abs/1207.7209




Recommendations





Cited In (20)





This page was built for publication: Concentration inequalities for order statistics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742953)