AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically


pub
Go Generating

AI Traceability

AI parses the academic lineage of this thesis


Master Reading Tree
Generate MRT

AI Insight

AI extracts a summary of this paper


Weibo:
Apart from being beautiful objects of study lying at the intersection of analysis, combinatorics, and geometry, the ideas and techniques generated in this field have led to a number of powerful algorithmic applications

Bounded Geometries, Fractals, and Low-Distortion Embeddings

FOCS, pp.534-534, (2003)

Cited by: 386|Views111
EI

Abstract

The doubling constant of a metric space (X, d) is the smallest value \lambda such that every ball in X can be covered by \lambda balls of half the radius. The doubling dimension of X is then defined as \dim (X) = \log _2 \lambda. A metric (or sequence of metrics) is called doubling precisely when its doubling dimension is bounded. This is...More

Code:

Data:

Introduction
  • A basic goal in the study of finite metric spaces is to approximate some class of metric spaces by another more simple or tractable class.
  • The authors consider embeddings of finite metric spaces into Lp spaces.
  • Given a metric (X, d), the goal is to find a map f : X → Lp such that ||f (x)−f (y)||p is close to d(x, y) for all x, y ∈ X.
  • The authors' goal is to find bounds on the achievable
Highlights
  • A basic goal in the study of finite metric spaces is to approximate some class of metric spaces by another more simple or tractable class
  • Apart from being beautiful objects of study lying at the intersection of analysis, combinatorics, and geometry, the ideas and techniques generated in this field have led to a number of powerful algorithmic applications
  • 1We are concerned mostly with finite metrics, but most of our results extend to arbitrary metric spaces via standard compactness arguments
  • We prove Assouad’s conjecture for trees, showing that every doubling tree can be embedded with constant distortion into constant dimensional lp space for every p ∈ [1, ∞], where both constants depend only on the doubling constant of the tree
Results
  • Results and techniques

    The authors are concerned with the broad roles of “volume” and “structure” in determining the embeddability of a metric.
  • In Section 2, the authors show that every doubling tree metric admits a constant distortion embedding into lOp (1) for any p ∈ [1, ∞]
  • This exhibits a very natural class of metric spaces which embed into l2 with O(1) distortion, but not isometrical√ly.
  • Some tree metrics require Ω distortion to embed into l2 [5], while w√e prove that some doubling metrics require distortion Ω
  • It is precisely the synthesis of these two properties that yields an enormous improvement in embeddability.
  • The authors do this by defining a notion of adjacency between paths, and arguing that the resulting graph has bounded chromatic number
Conclusion
  • Using the decomposition theorems i√n Section 3, the authors can show that doubling metrics admit (k, log n)-volume respecting embeddings for all k; doubling metrics can be embedded into distributions of doubling trees (HSTs of bounded degree) with distortion O, and they embed into the line with constant average distortion
  • These results can be used to improve approximation algorithms and online algorithms for doubling metrics.
  • The authors' tree coloring in conjunction with a modification of [11] show that the bandwidth of a graph with local density β is at most O(β1.5 log2 n)
Reference
  • N. Alon and J. H. Spencer. The probabilistic method. WileyInterscience, New York, second edition, 2000.
    Google ScholarFindings
  • P. Assouad. Plongements lipschitziens dans Rn. Bull. Soc. Math. France, 111(4):429–448, 1983.
    Google ScholarLocate open access versionFindings
  • Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291–301, 1998.
    Google ScholarLocate open access versionFindings
  • J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math., 52(1-2):46–52, 1985.
    Google ScholarLocate open access versionFindings
  • J. Bourgain. The metrical interpretation of superreflexivity in Banach spaces. Israel J. Math., 56(2):222–230, 1986.
    Google ScholarLocate open access versionFindings
  • B. Brinkman and M. Charikar. On the impossibility of dimension reduction in l1. To appear in 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
    Google ScholarLocate open access versionFindings
  • G. Calinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem. In 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 8–16. SIAM, 2001.
    Google ScholarLocate open access versionFindings
  • K. L. Clarkson. Nearest neighbor queries in metric spaces. In 29th Annual ACM Symposium on Theory of Computing, pages 609–617. ACM, New York, 1997.
    Google ScholarLocate open access versionFindings
  • M. M. Deza and M. Laurent. Geometry of cuts and metrics. SpringerVerlag, Berlin, 1997.
    Google ScholarFindings
  • U. Feige. Approximating the bandwidth via volume respecting embeddings. J. Comput. System Sci., 60(3):510–539, 2000.
    Google ScholarLocate open access versionFindings
  • A. Gupta. Improved bandwidth approximation for trees and chordal graphs. J. Algorithms, 40(1):24–36, 2001.
    Google ScholarLocate open access versionFindings
  • A. Gupta, I. Newman, Y. Rabinovich, and A. Sinclair. Cuts, trees and l1-embeddings of graphs. In 40th Annual Symposium on Foundations of Computer Science, pages 399–408. IEEE, 1999.
    Google ScholarLocate open access versionFindings
  • J. Heinonen. Lectures on analysis on metric spaces. Universitext. Springer-Verlag, New York, 2001.
    Google ScholarFindings
  • P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 10–33, 2001.
    Google ScholarLocate open access versionFindings
  • W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability, pages 189–206. Amer. Math. Soc., Providence, RI, 1984.
    Google ScholarLocate open access versionFindings
  • D. Karger and M. Ruhl. Finding nearest neighbors in growthrestricted metrics. In 34th Annual ACM Symposium on the Theory of Computing, pages 63–66, 2002.
    Google ScholarLocate open access versionFindings
  • R. Krauthgamer and J. Lee. Navigating nets: Simple algorithms for proximity search. Manuscript, 2003.
    Google ScholarFindings
  • R. Krauthgamer and J. R. Lee. The intrinsic dimensionality of graphs. In 35th Annual ACM Symposium on Theory of Computing, pages 438–447. ACM, 2003.
    Google ScholarLocate open access versionFindings
  • T. J. Laakso. Ahlfors Q-regular spaces with arbitrary Q > 1 admitting weak Poincareinequality. Geom. Funct. Anal., 10(1):111–123, 2000.
    Google ScholarLocate open access versionFindings
  • T. J. Laakso. Plane with A∞-weighted metric not bi-Lipschitz embeddable to RN. Bull. London Math. Soc., 34(6):667–676, 2002.
    Google ScholarLocate open access versionFindings
  • U. Lang and C. Plaut. Bilipschitz embeddings of metric spaces into space forms. Geom. Dedicata, 87(1-3):285–307, 2001.
    Google ScholarLocate open access versionFindings
  • J. R. Lee, M. Mendel, and A. Naor. Metric structures in L1: Dimension, snowflakes, and average distortion. Manuscript, July 2003.
    Google ScholarFindings
  • J. R. Lee and A. Naor. Embedding the diamond graph in Lp and dimension reduction in L1. Manuscript, June 2003.
    Google ScholarFindings
  • N. Linial. Finite metric spaces - combinatorics, geometry and algorithms. In Proceedings of the International Congress of Mathematicians III, pages 573–586, 2002.
    Google ScholarLocate open access versionFindings
  • N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215– 245, 1995.
    Google ScholarLocate open access versionFindings
  • J. Matousek. On embedding expanders into lp spaces. Israel J. Math., 102:189–197, 1997.
    Google ScholarLocate open access versionFindings
  • J. Matousek. On embedding trees into uniformly convex Banach spaces. Israel J. Math., 114:221–237, 1999.
    Google ScholarLocate open access versionFindings
  • J. Matousek. Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics. Springer-Verlag, 2002.
    Google ScholarFindings
  • I. Newman and Y. Rabinovich. A lower bound on the distortion of embedding planar metrics into Euclidean space. Discrete Comput. Geom., 29(1):77–81, 2003.
    Google ScholarLocate open access versionFindings
  • T. S. E. Ng and H. Zhang. Predicting internet network distance with coordinates-based approaches. In 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM-02), pages 170–179, 2002.
    Google ScholarLocate open access versionFindings
  • C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory Comput. Syst., 32(3):241–280, 1999.
    Google ScholarLocate open access versionFindings
  • S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In 15th Annual Symposium on Computational Geometry, pages 300–306. ACM, 1999.
    Google ScholarLocate open access versionFindings
  • S. Semmes. On the nonexistence of bi-Lipschitz parameterizations and geometric problems about A∞-weights. Rev. Mat. Iberoamericana, 12(2):337–410, 1996.
    Google ScholarLocate open access versionFindings
  • J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319–2323, 2000.
    Google ScholarLocate open access versionFindings
Your rating :
0

 

Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn
小科