An Exponential Concentration Inequality for the Components of a Uniform Random Vector on the Sphere

Abstract

We show that if X = (X1, …, XN) is a uniform random vector on the unit Euclidean sphere, the empirical CDF of the components of N X = ( N X1, …, N XN) concentrates exponentially rapidly in N around the standard Gaussian CDF . More precisely, we find explicit functions γ and g such that the Kolmogorov-Smirnov distance between the empirical CDF of the components of N X and deviates by more than ε + γ(t) with probability at most 2e-2Nε2 + e-Ng+(t)2 + e-Ng-(t)2 for ε > 0 and t∈[0,1). A weaker but more transparent inequality replacing γ and g with linear functions is obtained as a corollary. All functions and constants are explicit, so our bounds offer finite-sample guarantees for statistical applications.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…