Tight lower bounds for the size of epsilon-nets

János Pach, G. Tardos

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an ε-net of size. Using probabilistic techniques, Pach and Woeginger (1990) showed that there exist range spaces of VC-dimension 2, for which the above bound is sharp. The only known range spaces of small VC-dimension, in which the ranges are geometric objects in some Euclidean space and the size of the smallest ε-nets is superlinear in 1/ε, were found by Alon (2010). In his examples, every ε-net is of size, where g is an extremely slowly growing function, related to the inverse Ackermann function. We show that there exist geometrically defined range spaces, already of VC-dimension, in which the size of the smallest ε-nets is. We also construct range spaces induced by axis-parallel rectangles in the plane, in which the size of the smallest ε-nets is. By a theorem of Aronov, Ezra, and Sharir (2010), this bound is tight.

Original languageEnglish
Pages (from-to)645-658
Number of pages14
JournalJournal of the American Mathematical Society
Volume26
Issue number3
DOIs
Publication statusPublished - 2013

Fingerprint

VC Dimension
Lower bound
Range of data
Inverse function
Geometric object
Theorem
Rectangle
Euclidean space

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Cite this

Tight lower bounds for the size of epsilon-nets. / Pach, János; Tardos, G.

In: Journal of the American Mathematical Society, Vol. 26, No. 3, 2013, p. 645-658.

Research output: Contribution to journalArticle

@article{ce462fa3c6d741c19f4ac0c6ca9d9f79,
title = "Tight lower bounds for the size of epsilon-nets",
abstract = "According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an ε-net of size. Using probabilistic techniques, Pach and Woeginger (1990) showed that there exist range spaces of VC-dimension 2, for which the above bound is sharp. The only known range spaces of small VC-dimension, in which the ranges are geometric objects in some Euclidean space and the size of the smallest ε-nets is superlinear in 1/ε, were found by Alon (2010). In his examples, every ε-net is of size, where g is an extremely slowly growing function, related to the inverse Ackermann function. We show that there exist geometrically defined range spaces, already of VC-dimension, in which the size of the smallest ε-nets is. We also construct range spaces induced by axis-parallel rectangles in the plane, in which the size of the smallest ε-nets is. By a theorem of Aronov, Ezra, and Sharir (2010), this bound is tight.",
author = "J{\'a}nos Pach and G. Tardos",
year = "2013",
doi = "10.1090/S0894-0347-2012-00759-0",
language = "English",
volume = "26",
pages = "645--658",
journal = "Journal of the American Mathematical Society",
issn = "0894-0347",
publisher = "American Mathematical Society",
number = "3",

}

TY - JOUR

T1 - Tight lower bounds for the size of epsilon-nets

AU - Pach, János

AU - Tardos, G.

PY - 2013

Y1 - 2013

N2 - According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an ε-net of size. Using probabilistic techniques, Pach and Woeginger (1990) showed that there exist range spaces of VC-dimension 2, for which the above bound is sharp. The only known range spaces of small VC-dimension, in which the ranges are geometric objects in some Euclidean space and the size of the smallest ε-nets is superlinear in 1/ε, were found by Alon (2010). In his examples, every ε-net is of size, where g is an extremely slowly growing function, related to the inverse Ackermann function. We show that there exist geometrically defined range spaces, already of VC-dimension, in which the size of the smallest ε-nets is. We also construct range spaces induced by axis-parallel rectangles in the plane, in which the size of the smallest ε-nets is. By a theorem of Aronov, Ezra, and Sharir (2010), this bound is tight.

AB - According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an ε-net of size. Using probabilistic techniques, Pach and Woeginger (1990) showed that there exist range spaces of VC-dimension 2, for which the above bound is sharp. The only known range spaces of small VC-dimension, in which the ranges are geometric objects in some Euclidean space and the size of the smallest ε-nets is superlinear in 1/ε, were found by Alon (2010). In his examples, every ε-net is of size, where g is an extremely slowly growing function, related to the inverse Ackermann function. We show that there exist geometrically defined range spaces, already of VC-dimension, in which the size of the smallest ε-nets is. We also construct range spaces induced by axis-parallel rectangles in the plane, in which the size of the smallest ε-nets is. By a theorem of Aronov, Ezra, and Sharir (2010), this bound is tight.

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

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

U2 - 10.1090/S0894-0347-2012-00759-0

DO - 10.1090/S0894-0347-2012-00759-0

M3 - Article

VL - 26

SP - 645

EP - 658

JO - Journal of the American Mathematical Society

JF - Journal of the American Mathematical Society

SN - 0894-0347

IS - 3

ER -