Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Advances in Mathemat...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Advances in Mathematics
Article
License: Elsevier Non-Commercial
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Advances in Mathematics
Article . 2011
License: Elsevier Non-Commercial
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Advances in Mathematics
Article . 2011 . Peer-reviewed
License: Elsevier Non-Commercial
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2011
Data sources: zbMATH Open
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
DBLP
Conference object
Data sources: DBLP
versions View all 6 versions
addClaim

Advances in metric embedding theory

Authors: Abraham, Ittai; Bartal, Yair; Neiman, Ofer;

Advances in metric embedding theory

Abstract

The paper contains numerous improvements of the existing results on embeddings of metric spaces into Banach spaces. Many of these improvements are motivated by applications. One of the directions in which the existing results are improved is the following: many of the known results estimate the worst-case distortion, that is, if we restrict to non-contractive embeddings, one estimates the maximal expansion of distances. However, for many applications average expansion is more interesting. The authors construct an embedding (Theorem 2) which simultaneously achieves the best possible order of the worst-case Euclidean distortion and has uniformly bounded average distortion. The authors introduce several different notions of average distortion and prove some analogues of the above stated result for them. The authors improve the known bound for the dimension of low-distortion embeddings into \(\ell_p\) by proving (Theorem 4): For any \(1\leq p\leq\infty\), every \(n\)-point metric space embeds in \(\ell_p\) with distortion \(O(\log n)\) in dimension \(O(\log n)\). The authors prove the following result which connects the intrinsic dimension of a doubling space and its embedding dimension (Theorem 8): There exists a universal constant \(C\) such that for any \(n\)-point metric space \((X, d)\) and any \(C/\log\log n <\theta\leq 1\), there exists an embedding \(f :X\to\ell_p^D\) with distortion \(O(\log^{1+\theta}n)\) where \(D = O(\text{dim}(X)/\theta)\). The authors prove also interesting results on partial embeddings (the case where we care only about some of the distances) and on scaling distortion (the case where we allow relatively large distortions for relatively small amounts of distances). The main tool for the embedding theorems proved in this paper is the notion of uniformly padded probabilistic partitions of a metric space. This 100-page paper contains many other versions of the results mentioned above and some related results, the purpose of this review was only to mention some of the directions which were studied in the paper.

Country
United States
Keywords

Metric spaces, Mathematics(all), 000, Distance in graphs, dimension reduction, metric space, Embeddings of discrete metric spaces into Banach spaces; applications in topology and computer science, Coarse geometry, Approximation algorithms, Metric spaces, metrizability, Dimension reduction, bilipschitz embedding, Algorithms, Embedding

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    67
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
67
Top 10%
Top 10%
Top 10%
hybrid