articleRandom Structures and AlgorithmsNov 19, 2002Closed access

An elementary proof of a theorem of Johnson and Lindenstrauss

AT&T (United States) · Alcatel Lucent (Germany) · +1 more institution

Indexed incrossref

Abstract

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

Citation impact

958
total citations
FWCI
1.27
Percentile
100%
References
15
Citations per year

Authors

2

Topics & keywords

Keywords
  • struct
  • Elementary proof
  • Euclidean geometry
  • Mathematics
  • Euclidean space
  • Space (punctuation)
  • Combinatorics
  • Set (abstract data type)
No related works found for this paper.