Research output per year
Research output per year
Research output: Contribution to journal › Article › peer-review
Let F be a set system over an underlying finite set X, and let μ be a nonnegative measure over X; i.e., for every S ⊆ X, μ(S) = ∑_{xε}S μ(x). A measure μ* on X is called a multiplicative λ -approximation of μ on (F,X) if for every S ε F it holds that aμ(S) ≤ μ*(S) ≤ bμ(S), and b/a = λ ≥ 1. The central question raised and partially answered in the present paper is about the existence of meaningful structural properties of F implying that for any μ on X there exists an 1+∑ 1.∑ - approximation μ. supported on a small subset of X. It turns out that the parameter that governs the support size of a multiplicative approximation is the triangular rank of F, trk(F). It is defined as the maximal length of a sequence of sets {S _{i}}^{t}_{i}=1 in F such that for all 1 < i ≤ t, S_{i} ⊆ ∪_{j}<i S_{j}. We show that for any μ on X and 0 < ε < 1, there is measure μ. that 1+∑/1-∑ -approximates μ on (X,F), and has support of size ε Õ(trk(F). VCdim(F)/ε^{2}), where VCdim(F), bounded from above by trk(F), is the VC-dimension of F. We also present some alternative constructions which in some cases improve upon this bound. Conversely, we show that for any 0 ≤ ε < 1 there exists a μ on X that cannot be 1+∑/1-∑- approximated on (F,X) by any μ. with support of size < trk(F). For special families F this bound is improved to ω(trk(F)/ε). As an application we show a new dimension-reduction result for ℓ metrics: Any ℓ-metric on n points can be (efficiently) embedded with 1+∑/1-∑ -distortion into R^{O}(n/∑^{2}) equipped with the ℓ norm. This improves over the best previously known bound of Schechtman, showing that the dimension is bounded by O(n log n/poly(ε)). We obtain also some new results on efficient sampling of Euclidean volumes. In order to make the general framework applicable to this setting, we develop the basic theory of finite volumes, analogous to the theory of finite metrics, and get results of independent interest in this direction. To do so, we use basic combinatorial/topological facts about simplicial complexes, and study the naturally arising questions.
Original language | English |
---|---|
Pages (from-to) | 855-883 |
Number of pages | 29 |
Journal | SIAM Journal on Computing |
Volume | 42 |
Issue number | 3 |
DOIs | |
State | Published - 2013 |
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review