Explicit Universal Bounds for Cumulants via Moments
Abstract
We establish explicit, universal, and distribution-free bounds for the n-th cumulant, n(X), of a scalar random variable, controlled solely by an n-th order absolute moment functional Mn(X). The bounds take the form n(X) Cn Mn(X). Our principal contribution is the derivation of coefficients satisfying Cn (n-1)!/\,n, which offers an exponential improvement over classical bounds where the coefficients grow superexponentially (on the order of nn). We present a hierarchy of refinements where the rate parameter increases as the functional Mn(X) incorporates more structural information. The most general bound uses the raw moment Mn(X)=E[ Xn] with rate = 2 ≈ 0.693. Using the central moment Mn(X)=E[ X-E[X]n] improves the rate to cen ≈ 1.146, while assuming symmetry yields even higher rates. The proof is elementary, combining the moment-cumulant partition formula with a uniform moment-product inequality. We further prove that while these bounds are not attainable whenever the relevant coefficient is positive, they are asymptotically efficient given the limited information of a single moment. The utility of the bounds is demonstrated through an application to standardized cumulants of independent sums.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.