Johnson-Lindenstrauss lemma for circulant matrices

Random Structures and Algorithms

Volumn 39, Issue 3, 2011, Pages 391-398

  Hinrichs, Aicke ^a   Vybíral, Jan ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b JOHANN RADON INSTITUTE FOR COMPUTATIONAL AND APPLIED MATHEMATICS   (Austria)

Author keywords

Circulant matrices; Decoupling lemma; Johnson Lindenstrauss lemma

Indexed keywords

EID: 80052034277     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20360     Document Type: Article

References (18)

1. D. Achlioptas, Database-friendly random projections: Johnson-Lindenstrauss with binary coins, J Comput Syst Sci 66 (2003), 671-687.
2. N. Ailon and B. Chazelle, Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform, In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, Washington, 2006.
3. N. Ailon and B. Chazelle, The fast Johnson-Lindenstrauss transform and approximate nearest neighbors, SIAM J Comput 39 (2009), 302-322.
4. N. Ailon and E. Liberty, Almost optimal unrestricted fast Johnson-Lindenstrauss transform, Available at:, Accessed on May 30, 2010.
5. W. Bajwa, J. Haupt, G. Raz, S. Wright, and R. Nowak, Toeplitz-structured compressed sensing matrices, In IEEE Workshop SSP, Madison, Wisconsin, 2007.
6. W. U. Bajwa, J. Haupt, G. Raz, and R. Nowak, Compressed channel sensing, In Proceedings of the CISS08, Princeton, 2008.
7. J. Bourgain and L. Tzafriri, Invertibility of large submatrices with applications to the geometry of Banach spaces and harmonic analysis, Israel J Math 57 (1987), 137-224.
8. S. Dasgupta and A. Gupta, An elementary proof of a theorem of Johnson and Lindenstrauss, Random Struct Algorithms 22 (2003), 60-65.
9. G. Golub and C. F. van Loan, Matrix computations, 3rd edition, The Johns Hopkins University Press, Baltimore, Maryland, 1996.
10. U. Haagerup, The best constants in the Khintchine inequality, Studia Math 70 (1982), 231-283.
11. D. L. Hanson and F. T. Wright, A bound on tail probabilities for quadratic forms in independent random variables, Ann Math Statist 42 (1971), 1079-1083.
12. P. Indyk and R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, Texas, 1998, pp. 604-613.
13. P. Indyk, A. Naor, Nearest neighbor preserving embeddings, ACM Trans Algorithms 3 (2007), Article no. 31.
14. W. B. Johnson and J. Lindenstrauss, Extensions of Lipschitz mappings into a Hilbert space, Contem Math 26 (1984), 189-206.
15. R. Latala, Estimates of moments and tails of Gaussian chaoses, Ann Prob 34 (2006), 2315-2331.
16. B. Laurent, P. Massart, Adaptive estimation of a quadratic functional by model selection, Ann Statist 28 (2000), 1302-1338.
17. J. Matoušek, On variants of the Johnson-Lindenstrauss lemma, Random Struct Algorithms 33 (2008), 142-156.
18. H. Rauhut, Circulant and Toeplitz matrices in compressed sensing, In Proceeding of the SPARS'09, Saint-Malo, France, 2009.