Low dimensional embeddings of ultrametrics

نویسندگان

  • Yair Bartal
  • Nathan Linial
  • Manor Mendel
  • Assaf Naor
چکیده

In this note we show that every n-point ultrametric embeds with constant distortion in l O(logn) p for every ∞ ≥ p ≥ 1. More precisely, we consider a special type of ultrametric with hierarchical structure called a k-hierarchically well-separated tree (k-HST). We show that any k-HST can be embedded with distortion at most 1 + O(1/k) in l O(k2 logn) p . These facts have implications to embeddings of finite metric spaces in low dimensional lp spaces in the context of metric Ramsey-type theorems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics

The theoretical computer science community has traditionally used embeddings of finite metrics as a tool in designing approximation algorithms. Recently, however, there has been considerable interest in using metric embeddings in the context of networks to allow network nodes to have more knowledge of the pairwise distances between other nodes in the network. There has also been evidence that n...

متن کامل

Metric embedding with outliers

We initiate the study of metric embeddings with outliers. Given some metric space (X, ρ) we wish to find a small set of outlier points K ⊂ X and either an isometric or a low-distortion embedding of (X \K, ρ) into some target metric space. This is a natural problem that captures scenarios where a small fraction of points in the input corresponds to noise. For the case of isometric embeddings we ...

متن کامل

Online Embeddings

We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X,D). Our goal is to compute a low-distortion embedding of M into some host space, which has to be constructed in an on-line fashion, so that the image of each xi depends only on x1, . . . , xi. We prove several results translating ...

متن کامل

Algorithmic embeddings

We present several computationally efficient algorithms, and complexity results on low distortion mappings between metric spaces. An embedding between two metric spaces is a mapping between the two metric spcaes and the distortion of the embedding is the factor by which the distances change. We have pioneered theoretical work on relative (or approximation) version of this problem. In this setti...

متن کامل

Multiembedding of Metric Spaces

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding’s distortion is. For example, embedding finite metric space into trees may require linear distortion as a function of its size. Using probabilistic metric embeddings, the bound on the distortion reduces to logarithmic in the size. We make a step in the direc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2004