Lower Bounds for Randomized $k$-Serverand Motion-Planning Algorithms
SIAM Journal on Computing
Lectures on Discrete Geometry
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
SIAM Journal on Computing
On metric ramsey-type phenomena
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Some Low Distortion Metric Ramsey Problems
Discrete & Computational Geometry
Ramsey-type theorems for metric spaces with applications to online problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
| Hi-index | 0.00 |
In this paper, we examine the metric Ramsey problem for the normed spaces lp: given some 1 ≤ p ≤ ∞, α ≥ 1 and an integer n, we ask for the largest m such that every n-point metric space contains an m-point subspace which embeds into lp with distortion at most α. Bartal, Linial, Mendel and Naor show in [3] that in the case of 1 ≤ p ≤ 2, the dependence of m on α undergoes a phase transition at α = 2. The case of p 2 was left as an open problem. We show that the phase transition occurs around α = 2 for all p ≥ 1. The basis of our result is a proof that there exist {1, 2} metrics which require distortion arbitrarily close to 2 for embedding into lp. In order to show this, we develop new tools for analyzing embeddings of random metrics into lp.