Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 53 tok/s
Gemini 2.5 Pro 43 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 14 tok/s Pro
GPT-4o 96 tok/s Pro
Kimi K2 146 tok/s Pro
GPT OSS 120B 439 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Second Order Approximations for Slightly Trimmed Sums (1104.3347v1)

Published 17 Apr 2011 in math.PR

Abstract: We investigate the second order asymptotic behavior of trimmed sums $T_n=\frac 1n \sum_{i=\kn+1}{n-\mn}\xin$, where $\kn$, $\mn$ are sequences of integers, $0\le \kn < n-\mn \le n$, such that $\min(\kn, \mn) \to \infty$, as $\nty$, the $\xin$'s denote the order statistics corresponding to a sample $X_1,...,X_n$ of $n$ i.i.d. random variables. In particular, we focus on the case of slightly trimmed sums with vanishing trimming percentages, i.e. we assume that $\max(\kn,\mn)/n\to 0$, as $\nty$, and heavy tailed distribution $F$, i.e. the common distribution of the observations $F$ is supposed to have an infinite variance. We derive optimal bounds of Berry -- Esseen type of the order $O\bigl(r_n{-1/2}\bigr)$, $r_n=\min(\kn,\mn)$, for the normal approximation to $T_n$ and, in addition, establish one-term expansions of the Edgeworth type for slightly trimmed sums and their studentized versions. Our results supplement previous work on first order approximations for slightly trimmed sums by Csorgo, Haeusler and Mason (1988) and on second order approximations for (Studentized) trimmed sums with fixed trimming percentages by Gribkova and Helmers (2006, 2007).

Summary

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

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube