# Quantitative asymptotics of graphical projection pursuit

@inproceedings{Meckes2008QuantitativeAO, title={Quantitative asymptotics of graphical projection pursuit}, author={Elizabeth S. Meckes}, 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… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.

SHOWING 1-4 OF 4 CITATIONS

## Error Probabilities for Halfspace Depth

VIEW 1 EXCERPT

CITES BACKGROUND

## Maximum Clusterability Divisive Clustering

VIEW 1 EXCERPT

CITES BACKGROUND

## Approximation of Projections of Random Vectors

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-6 OF 6 REFERENCES

## Linear functions on the classical matrix groups

VIEW 9 EXCERPTS

## Asymptotic theory of finite dimensional normed spaces

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## An infinitesimal version of Stein’s method of exchangeable pairs

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Concentration of the Spectral Measure for Large Matrices

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## The accuracy of the normal approximation to the distribution of the traces of powers of random orthogonal matrices

VIEW 2 EXCERPTS

## Asymptotics of Graphical Projection Pursuit

VIEW 3 EXCERPTS