# Quantitative asymptotics of graphical projection pursuit

@article{Meckes2008QuantitativeAO,
title={Quantitative asymptotics of graphical projection pursuit},
author={Elizabeth S. Meckes},
journal={arXiv: Probability},
year={2008}
}
There is a result of Diaconis and Freedman which says that, in a limiting sense, for large collections of high-dimensional data most one-dimensional projections of the data are approximately Gaussian. This paper gives quantitative versions of that result. For a set of deterministic vectors $\{x_i\}_{i=1}^n$ in $\R^d$ with $n$ and $d$ fixed, let $\theta\in\s^{d-1}$ be a random point of the sphere and let $\mu_n^\theta$ denote the random measure which puts mass $\frac{1}{n}$ at each of the points…
Approximation of Projections of Random Vectors
Let X be a d-dimensional random vector and Xθ its projection onto the span of a set of orthonormal vectors {θ1,…,θk}. Conditions on the distribution of X are given such that if θ is chosen according
Uniform convergence rates for halfspace depth
• Mathematics, Computer Science
• 2017
On low-dimensional projections of high-dimensional distributions
• Mathematics
• 2013
Let P be a probability distribution on q -dimensional space. The so-called Diaconis-Freedman effect means that for a fixed dimension d<<q , most d -dimensional projections of P look like a scale
Error Probabilities for Halfspace Depth
• Mathematics, Geology
ArXiv
• 2016
The geometry of halfspace depth is used to improve the explicit bounds on the rate of convergence, and this paper shows that as the sample size increases, the halfspace Depth for a sample converges to the half space depth for the underlying distribution, almost surely.
Pointwise Weyl law for graphs from quantized interval maps
We prove an analogue of the pointwise Weyl law for families of unitary matrices obtained from quantization of one-dimensional interval maps. This quantization for interval maps was introduced by
Maximum Clusterability Divisive Clustering
• Computer Science
2015 IEEE Symposium Series on Computational Intelligence
• 2015
This work uses bi-partitioning recursively to generate high quality clustering models and illustrates the improvement over standard dimension reduction and clustering techniques, and evaluates the method in experiments on real and simulated data sets.

## References

SHOWING 1-8 OF 8 REFERENCES
Asymptotic Theory Of Finite Dimensional Normed Spaces
• Mathematics
• 1986
The Concentration of Measure Phenomenon in the Theory of Normed Spaces.- Preliminaries.- The Isoperimetric Inequality on Sn?1 and Some Consequences.- Finite Dimensional Normed Spaces, Preliminaries.-
Linear functions on the classical matrix groups
Let M be a random matrix in the orthogonal group On, distributed according to Haar measure, and let A be a fixed n x n matrix over R such that Tr(AA t ) = n. Then the total variation distance of the
CONCENTRATION OF THE SPECTRAL MEASURE FOR LARGE MATRICES
• Mathematics, Computer Science
• 2000
We derive concentration inequalities for functions of the empirical measure of eigenvalues for large, random, self adjoint matrices, with not necessarily Gaussian entries. The results presented apply
An infinitesimal version of Stein’s method of exchangeable pairs
• Doctoral dissertation, Stanford University,
• 2006
The accuracy of the normal approximation to the distribution of the traces of powers of random orthogonal matrices
• The accuracy of the normal approximation to the distribution of the traces of powers of random orthogonal matrices
• 1995