Construct · 1 fields · 1 citations

Bourgain's embedding theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph algorithms

the result that any finite metric on n points embeds into Euclidean space with distortion logarithmic in n.

In graph algorithms, Bourgain's embedding theorem refers to the result that any finite metric on n points embeds into Euclidean space with distortion logarithmic in n. This meaning comes from Bourgain (1985) in Israel Journal of Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Bourgain's embedding theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

distortion4 fields · 7 citationsjingle · one word, four constructs embedding2 fields · 3 citationsjingle · one word, two constructs metric4 fields · 4 citationsjingle · one word, four constructs

References

Bourgain, J. (1985). On lipschitz embedding of finite metric spaces in Hilbert space. Israel Journal of Mathematics, 52(1-2), 46-52. https://doi.org/10.1007/bf02776078

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct