Light Spanners for High Dimensional Norms via Stochastic Decompositions

04/20/2018
by   Arnold Filtser, et al.
0

Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and Sidiropoulos (SODA 2013), who showed that any n-point Euclidean metric has an O(t)-spanner with Õ(n^1+1/t^2) edges, little is known. In this paper we study several aspects of spanners in high dimensional normed spaces. First, we build spanners for finite subsets of ℓ_p with 1<p< 2. Second, our construction yields a spanner which is both sparse and also light, i.e., its total weight is not much larger than that of the minimum spanning tree. In particular, we show that any n-point subset of ℓ_p for 1<p< 2 has an O(t)-spanner with n^1+Õ(1/t^p) edges and lightness n^Õ(1/t^p). In fact, our results are more general, and they apply to any metric space admitting a certain low diameter stochastic decomposition. It is known that arbitrary metric spaces have an O(t)-spanner with lightness O(n^1/t). We exhibit the following tradeoff: metrics with decomposability parameter ν=ν(t) admit an O(t)-spanner with lightness Õ(ν^1/t). For example, n-point Euclidean metrics have ν< n^1/t, metrics with doubling constant λ have ν<λ, and graphs of genus g have ν< g. While these families do admit a (1+ϵ)-spanner, its lightness depend exponentially on the dimension (resp. g). Our construction alleviates this exponential dependency, at the cost of incurring larger stretch.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2020

A Unified and Fine-Grained Approach for Light Spanners

Seminal works on light spanners from recent years provide near-optimal t...
research
11/21/2022

Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings

Chan, Har-Peled, and Jones [SICOMP 2020] developed locality-sensitive or...
research
02/21/2022

Online Spanners in Metric Spaces

Given a metric space ℳ=(X,δ), a weighted graph G over X is a metric t-sp...
research
07/31/2023

Light, Reliable Spanners

A ν-reliable spanner of a metric space (X,d), is a (dominating) graph H,...
research
07/29/2021

Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners

Spanners for metric spaces have been extensively studied, both in genera...
research
05/10/2020

Plurality in Spatial Voting Games with constant β

Consider a set of voters V, represented by a multiset in a metric space ...
research
10/20/2022

Data analysis and the metric evolution of hypergraphs

In this paper we aim to use different metrics in the Euclidean space and...

Please sign up or login with your details

Forgot password? Click here to reset