%0 Journal Article %1 dasgupta2003elementary %A Dasgupta, Sanjoy %A Gupta, Anupam %D 2003 %I Wiley Subscription Services, Inc., A Wiley Company %J Random Structures & Algorithms %K johnson-lindenstrauss proof %N 1 %P 60--65 %R 10.1002/rsa.10073 %T An elementary proof of a theorem of Johnson and Lindenstrauss %U http://dx.doi.org/10.1002/rsa.10073 %V 22 %X A result of Johnson and Lindenstrauss 13 shows that a set of n points in high dimensional Euclidean space can be mapped into an O(log n/ϵ2)-dimensional Euclidean space such that the distance between any two points changes by only a factor of (1 ± ϵ). In this note, we prove this theorem using elementary probabilistic techniques. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 22: 60–65, 2002

@article{dasgupta2003elementary, abstract = {A result of Johnson and Lindenstrauss [13] shows that a set of n points in high dimensional Euclidean space can be mapped into an O(log n/ϵ2)-dimensional Euclidean space such that the distance between any two points changes by only a factor of (1 ± ϵ). In this note, we prove this theorem using elementary probabilistic techniques. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 22: 60–65, 2002}, added-at = {2018-01-24T17:25:06.000+0100}, author = {Dasgupta, Sanjoy and Gupta, Anupam}, biburl = {https://www.bibsonomy.org/bibtex/29c36f970ddce281c9d5b87abd646fbb1/thoni}, description = {An elementary proof of a theorem of Johnson and Lindenstrauss - Dasgupta - 2002 - Random Structures & Algorithms - Wiley Online Library}, doi = {10.1002/rsa.10073}, interhash = {1581ea95880e4c2f802661da382e420a}, intrahash = {9c36f970ddce281c9d5b87abd646fbb1}, issn = {1098-2418}, journal = {Random Structures & Algorithms}, keywords = {johnson-lindenstrauss proof}, number = 1, pages = {60--65}, publisher = {Wiley Subscription Services, Inc., A Wiley Company}, timestamp = {2018-01-24T17:25:06.000+0100}, title = {An elementary proof of a theorem of Johnson and Lindenstrauss}, url = {http://dx.doi.org/10.1002/rsa.10073}, volume = 22, year = 2003 }