Advances in metric embedding theory (Q5894374): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Advances in metric embedding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local embeddings of metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local embeddings of metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Volume in General Metric Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean distortion and the sparsest cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plongements lipschitziens dans ${\bbfR}\sp n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating min-sum <i>k</i> -clustering in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON METRIC RAMSEY-TYPE DICHOTOMIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some low distortion metric Ramsey problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On metric Ramsey-type phenomena / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems for metric spaces with applications to online problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lipschitz embedding of finite metric spaces in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The metrical interpretation of superreflexivity in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hilbertian subsets of finite metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners with Slack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Embeddings with Relaxed Guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Generating Fundamental Cycles in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact routing with slack / rank
 
Normal rank
Property / cites work
 
Property / cites work: New length bounds for cycle bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonexistence of uniform homeomorphisms between \(L^ p\)-spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-conquer approximation algorithms via spreading metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for minimum-weight vertex separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dimension of almost spherical sections of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate max-flow min-(multi)cut theorems and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filling Riemannian manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved search heuristics for the sa-tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding \(l_ p^ m\) into \(l_ 1^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded minors, network decomposition, and multicommodity flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: The small-world phenomenon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulation and embedding using small sets of beacons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for classification problems with pairwise relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph sparsification and nearly optimal ultrasparsifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact routing with slack in low doubling dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaching Optimality for Solving SDD Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measured descent: A new embedding method for finite metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Lipschitz functions via random metric partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric structures in \(L_1\): dimension, snowflakes, and average distortion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4549227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distortion required for embedding finite metric spaces into normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding expanders into \(\ell_p\) spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding trees into uniformly convex Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey partitions and proximity data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On average distortion of embedding metrics into the line and into L <sub>1</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the distortion of embedding finite metric spaces in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonexistence of bilipschitz parameterizations and geometric problems about \(A_ \infty\)-weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees / rank
 
Normal rank

Latest revision as of 17:51, 4 July 2024

scientific article; zbMATH DE number 5985533
Language Label Description Also known as
English
Advances in metric embedding theory
scientific article; zbMATH DE number 5985533

    Statements

    Advances in metric embedding theory (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2011
    0 references
    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.
    0 references
    bilipschitz embedding
    0 references
    dimension reduction
    0 references
    metric space
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references