English

Spherical Cap Packing Asymptotics and Rank-Extreme Detection

Statistics Theory 2017-05-08 v2 Information Theory math.IT Data Analysis, Statistics and Probability Methodology Machine Learning Statistics Theory

Abstract

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a stochastically independent uniformly distributed unit vector. When the set of unit vectors are themselves independently uniformly distributed, we further develop the extreme value distribution limit of the maximal inner product, which characterizes its uncertainty around the bound. As applications of the above asymptotic results, we derive (1) an asymptotic sharp universal uniform bound on the maximal spurious correlation, as well as its uniform convergence in distribution when the explanatory variables are independently Gaussian distributed; and (2) an asymptotic sharp universal bound on the maximum norm of a low-rank elliptically distributed vector, as well as related limiting distributions. With these results, we develop a fast detection method for a low-rank structure in high-dimensional Gaussian data without using the spectrum information.

Keywords

Cite

@article{arxiv.1511.06198,
  title  = {Spherical Cap Packing Asymptotics and Rank-Extreme Detection},
  author = {Kai Zhang},
  journal= {arXiv preprint arXiv:1511.06198},
  year   = {2017}
}

Comments

14 pages; 1 figure. Accepted Jan 31, 2017 by IEEE Transactions on Information Theory

R2 v1 2026-06-22T11:49:26.527Z