Ramsey partitions and proximity data structures

Manor Mendel, Assaf Naor

Research output: Contribution to journalArticle

Abstract

This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (also known as the non-linear version of the isomorphic Dvoretzky theorem, as introduced by Bourgain, Figiel, and Milman in [8]). We then proceed to construct optimal Ramsey partitions, and use them to show that for every ε ∈ (0, 1), every n-point metric space has a subset of size n1-ε which embeds into Hubert space with distortion O(1/ε). This result is best possible and improves part of the metric Ramsey theorem of Bartal, Linial, Mendel and Naor [5], in addition to considerably simplifying its proof. We use our new Ramsey partitions to design approximate distance oracles with a universal constant query time, closing a gap left open by Thorup and Zwick in [32]. Namely, we show that for every n-point metric space X, and k ≥ 1, there exists an O(k)-approximate distance oracle whose storage requirement is 0(n1+1/k), and whose query time is a universal constant. We also discuss applications of Ramsey partitions to various other geometric data structure problems, such as the design of efficient data structures for approximate ranking.

Original languageEnglish (US)
Pages (from-to)253-275
Number of pages23
JournalJournal of the European Mathematical Society
Volume9
Issue number2
StatePublished - 2007

Fingerprint

Proximity
Data structures
Data Structures
Partition
Metric space
Geometric Data Structures
Computer science
Isomorphic
Approximate Design
Query
Ramsey's Theorem
Metric
Geometric Analysis
Hubert Space
Theorem
Ranking
Computer Science
Intersection
Imply
Subset

Keywords

  • Approximate distance oracle
  • Metric Ramsey theorem
  • Proximity data structure

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Cite this

Ramsey partitions and proximity data structures. / Mendel, Manor; Naor, Assaf.

In: Journal of the European Mathematical Society, Vol. 9, No. 2, 2007, p. 253-275.

Research output: Contribution to journalArticle

Mendel, Manor ; Naor, Assaf. / Ramsey partitions and proximity data structures. In: Journal of the European Mathematical Society. 2007 ; Vol. 9, No. 2. pp. 253-275.
@article{34df7c4665dc471dafa972707a5b77b0,
title = "Ramsey partitions and proximity data structures",
abstract = "This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (also known as the non-linear version of the isomorphic Dvoretzky theorem, as introduced by Bourgain, Figiel, and Milman in [8]). We then proceed to construct optimal Ramsey partitions, and use them to show that for every ε ∈ (0, 1), every n-point metric space has a subset of size n1-ε which embeds into Hubert space with distortion O(1/ε). This result is best possible and improves part of the metric Ramsey theorem of Bartal, Linial, Mendel and Naor [5], in addition to considerably simplifying its proof. We use our new Ramsey partitions to design approximate distance oracles with a universal constant query time, closing a gap left open by Thorup and Zwick in [32]. Namely, we show that for every n-point metric space X, and k ≥ 1, there exists an O(k)-approximate distance oracle whose storage requirement is 0(n1+1/k), and whose query time is a universal constant. We also discuss applications of Ramsey partitions to various other geometric data structure problems, such as the design of efficient data structures for approximate ranking.",
keywords = "Approximate distance oracle, Metric Ramsey theorem, Proximity data structure",
author = "Manor Mendel and Assaf Naor",
year = "2007",
language = "English (US)",
volume = "9",
pages = "253--275",
journal = "Journal of the European Mathematical Society",
issn = "1435-9855",
publisher = "European Mathematical Society Publishing House",
number = "2",

}

TY - JOUR

T1 - Ramsey partitions and proximity data structures

AU - Mendel, Manor

AU - Naor, Assaf

PY - 2007

Y1 - 2007

N2 - This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (also known as the non-linear version of the isomorphic Dvoretzky theorem, as introduced by Bourgain, Figiel, and Milman in [8]). We then proceed to construct optimal Ramsey partitions, and use them to show that for every ε ∈ (0, 1), every n-point metric space has a subset of size n1-ε which embeds into Hubert space with distortion O(1/ε). This result is best possible and improves part of the metric Ramsey theorem of Bartal, Linial, Mendel and Naor [5], in addition to considerably simplifying its proof. We use our new Ramsey partitions to design approximate distance oracles with a universal constant query time, closing a gap left open by Thorup and Zwick in [32]. Namely, we show that for every n-point metric space X, and k ≥ 1, there exists an O(k)-approximate distance oracle whose storage requirement is 0(n1+1/k), and whose query time is a universal constant. We also discuss applications of Ramsey partitions to various other geometric data structure problems, such as the design of efficient data structures for approximate ranking.

AB - This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (also known as the non-linear version of the isomorphic Dvoretzky theorem, as introduced by Bourgain, Figiel, and Milman in [8]). We then proceed to construct optimal Ramsey partitions, and use them to show that for every ε ∈ (0, 1), every n-point metric space has a subset of size n1-ε which embeds into Hubert space with distortion O(1/ε). This result is best possible and improves part of the metric Ramsey theorem of Bartal, Linial, Mendel and Naor [5], in addition to considerably simplifying its proof. We use our new Ramsey partitions to design approximate distance oracles with a universal constant query time, closing a gap left open by Thorup and Zwick in [32]. Namely, we show that for every n-point metric space X, and k ≥ 1, there exists an O(k)-approximate distance oracle whose storage requirement is 0(n1+1/k), and whose query time is a universal constant. We also discuss applications of Ramsey partitions to various other geometric data structure problems, such as the design of efficient data structures for approximate ranking.

KW - Approximate distance oracle

KW - Metric Ramsey theorem

KW - Proximity data structure

UR - http://www.scopus.com/inward/record.url?scp=33846646989&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846646989&partnerID=8YFLogxK

M3 - Article

VL - 9

SP - 253

EP - 275

JO - Journal of the European Mathematical Society

JF - Journal of the European Mathematical Society

SN - 1435-9855

IS - 2

ER -