Counting faces of randomly projected polytopes when the projection radically lowers dimension

Journal of the American Mathematical Society

Volumn 22, Issue 1, 2009, Pages 1-53

  Donoho, David L ^a   Tanner, Jared ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 57349138185     PISSN: 08940347     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0894-0347-08-00600-0     Document Type: Article

References (34)

1. Fernando Affentranger and Rolf Schneider, Random projections of regular simplices, Discrete Comput. Geom. 7 (1992), no. 3, 219-226. MR1149653 (92k:52008)
2. Norman Bleistein and Richard A Handelsman, Asymptotic expansions of integrals, Dover, New York, 1986. MR863284 (89d:41049)
3. Károly Böröczky, Jr. and Martin Henk, Random projections of regular polytopes, Arch. Math. (Basel) 73 (1999), no. 6, 465-473. MR1725183 (2001b:52004)
4. Emmanuel J. Candès, Justin Romberg, and Terence Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory 52 (2006), no. 2, 489-509. MR2236170 (2007e:94020)
5. Emmanuel J. Candès and Terence Tao, Decoding via linear programming, IEEE Trans. Inform. Theory 51 (2005), no. 12, 4203-4215. MR2243152 (2007b:94313)
6. -, Near optimal signal recovery from random projections and universal encoding strategies, IEEE. Trans. Info. Thry. 52 (2006), 5406-5425. MR2300700
7. E. W. Cheney, Introduction to approximation theory, Chelsea, New York, 1982. MR1656150 (99f:41001)
8. David L. Donoho, Compressed sensing, IEEE. Trans. Info. Thry. 52 (2006), no. 4, 1289-1306. MR2241189 (2007e:94013)
9. 1-norm solution is the sparsest solution, Comm. Pure Appl. Math. 59 (2006), no. 7, 907-934. MR2222440 (2006m:65079)
10. -, High-dimensional centrally-symmetric polytopes with neighborliness proportional to dimension, Disc. Comput. Geometry 35 (2006), no. 4, 617-652. MR2225676 (2007h:52012)
11. -, Neighborly polytopes and sparse solutions of underdetermined linear equations, Technical report Stanford University, Department of Statistics, # 2005-04 (2005).
12. David L. Donoho and Jared Tanner, Neighborliness of randomly-projected simplices in high dimensions, Proc. Natl. Acad. Sci. USA 102 (2005), no. 27, 9452-9457. MR2168716
13. -, Sparse nonnegative solutions of underdetermined linear equations by linear programming, Proc. Natl. Acad. Sci. USA 102 (2005), no. 27, 9446-9451. MR2168715 (2006d:90089)
14. -, Finite dimensional phase transition for the expected number of randonly-projected simplices and cross-polytopes, preprint (2007).
15. M. F. Duarte, M. B. Wakin, and R. G. Baraniuk, Fast reconstruction of piecewise smooth signals from random projections, Proceedings SPARS 05, Rennes, France, 2005.
16. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Info. Thry. 24 (1978), 384-386. MR0495180 (58:13912)
17. David Gale, Neighboring vertices on a convex polyhedron, Linear inequalities and related system, Annals of Mathematics Studies, no. 38, Princeton University Press, Princeton, N. J., 1956, pp. 255-263. MR0085552
18. -, Neighborly and cyclic polytopes, Proc. Sympos. Pure Math., Vol. VII, Amer. Math. Soc, Providence, R. I., 1963, pp. 225-232. MR0152944 (27:2915)
19. Branko Grünbaum, Convex polytopes, second ed., Graduate Texts in Mathematics, vol. 221, Springer-Verlag, New York, 2003, prepared and with a preface by Volker Kaibel, Victor Klee and Gun̈ter M. Ziegler. MR1976856
20. P. Hall, J. S. Marron, and A. Neeman, Geometric representation of high dimensional low sample size data, J. Roy. Stat. Soc. B 67 (2005), 427-444. MR2155347
21. Jarvis Haupt and Robert A. Nowak, Signal reconstruction from noisy randomized projections with applications to wireless sensing, Tech. report, Electrical Engineering, University of Wisconsin, 2005.
22. J. Hoffman-Jorgensen, J. A. Wellner, and M. B. Marcus, High-dimensional probability III, Birkhauser, Boston, 2004. MR2033877 (2004j:60005)
23. Irene Hueter, Limit theorems for the convex hull of random points in higher dimensions, Trans. Amer. Math. Soc. 351 (1999), no. 11, 4337-4363. MR1670156 (2000a:52008)
24. M. Kendall, A. Stuart, and J. K. Ord, Kendall's advanced theory of statistics, Edward Arnold, London, 1991.
25. Nathan Linial and Isabella Novik, How neighborly can a centrally symmetric polytope be?, Disc. Comput. Geometry 36 (2006), no. 2, 273-281. MR2252105 (2007f:52027)
26. Jiri Matousek, Lectures on discrete geometry, Graduate Texts in Mathematics, vol. 212, Springer-Verlag, New York, 2002. MR1899299 (2003f:52011)
27. Peter McMullen and Geoffrey C. Shephard, Diagrams for centrally symmetric polytopes, Mathematika 15 (1968), 123-138. MR0238180 (38:6456)
28. Harold Ruben, On the geometrical moments of skew-regular simplices in hyper spherical space, with some applications in geometry and mathematical statistics, Acta Math. 103 (1960), 1-23. MR0121713 (22:12447)
29. M. Rudelson and R. Vershynin, Geometric approach to error-correcting codes and reconstruction of signals, Tech. report, Department of Mathematics, University of California, Davis, 2005. MR2206919 (2006j:94116)
30. -, Sparse reconstruction by convex relaxation: Fourier and gaussian measurements, Proceedings Conference on Information Science and Systems (CISS) 2006, Princeton University, 2006.
31. Rolf Schneider, Neighbourliness of centrally symmetric polytopes in high dimensions, Mathematika 22 (1975), no. 2, 176-181. MR0405244 (53:9038)
32. J. A. Tropp and Anna Gilbert, Signal recovery from partial information by orthogonal matching pursuit, Tech. report, Mathematics Department, University of Michigan, 2005.
33. Y. Tsaig and D. L. Donoho, Extensions of compressed sensing, EURASIP Journal of Applied Signal Processing 86 (2006), no. 3, 549-571.
34. A. M. Vershik and P. V. Sporyshev, Asymptotic behavior of the number of faces of random polyhedra and the neighborliness problem, Selecta Math. Soviet. 11 (1992), no. 2, 181-201. MR1166627 (93d:60017)