---
title: Epsilon Nets in Combinatorial Geometry
url: https://www.emergentmind.com/topics/epsilon-nets
type: topic
---

# Epsilon Nets in Combinatorial Geometry

An ε-net is a fundamental structure in combinatorial geometry and learning theory, ensuring that all "large" subsets (ranges) of a given set are intersected ("stabbed") by a small auxiliary set. ε-nets play a pivotal role across geometric discrepancy theory, range searching, statistical learning (PAC theory), and extremal combinatorics, with key connections to VC-dimension, approximation algorithms, and the structure of geometric set systems. Their theory includes both classical "strong" ε-nets (hitting points within the original ground set) and "weak" ε-nets (allowing arbitrary stabbing points), as well as significant geometric, algorithmic, and extremal consequences.

## 1. Formal Definitions and Variants

Let $(X, \mathcal{R})$ be a finite range space, with $X$ a ground set, $\mathcal{R}\subseteq 2^X$ a family of ranges.

- **Strong ε-net:** For $0 < \varepsilon < 1$ and finite $X$ of size $n$, a subset $N\subseteq X$ is an ε-net if  
  \[
  \forall R\in\mathcal{R} : |R\cap X| \ge \varepsilon n \implies N\cap R\neq\emptyset.
  \]
- **Weak ε-net:** For geometric contexts (e.g., convex sets in $\mathbb{R}^d$), a set $N \subset \mathbb{R}^d$ (not necessarily contained in $X$) is a weak ε-net for $(X, \mathcal R)$ if every $R\in\mathcal{R}$ with $|R\cap X|\ge \varepsilon n$ intersects $N$.

- **Weighted ε-net:** For weighted points or when fractional approximations are required, a set $N$, possibly with multiplicities/weights, is considered, and the ε-net condition demands intersection in a weighted sense [2002.08693].

- **ε-$t$-net:** Generalizes the classical case: instead of stabbing with single points, an ε-$t$-net is a family of size-$t$ subsets such that every large range contains at least one such $t$-tuple [2003.07061].

## 2. Fundamental Results: Bounds, Constructions, and Complexity

### VC-Dimension and Size Bounds

The combinatorial richness of $\mathcal{R}$ is measured by the VC-dimension $d$. The foundational theorem (Haussler–Welzl):

\[
\text{If VC-dim}(\mathcal{R}) = d, \text{ then every } (X, \mathcal{R}) \text{ admits an } \varepsilon\text{-net of size } O\left(\frac{d}{\varepsilon}\,\log\frac{1}{\varepsilon}\right).
\]
Equality holds up to constants: in general, there exist range spaces of VC-dimension $d \ge 2$ where every $\varepsilon$-net has size at least $\Omega((d/\varepsilon)\log(1/\varepsilon))$ [1012.1240, 1702.03676].

For geometric range spaces:
- **Halfspaces in $\mathbb{R}^2, \mathbb{R}^3$, disks in $\mathbb{R}^2$:** The $O(1/\varepsilon)$ bound is achievable, omitting the logarithmic factor [1410.3154, 1501.03246].
- **Rectangles in the plane:** The tight bound is $O(\frac{1}{\varepsilon} \log\log(1/\varepsilon))$, and this is sharp [1012.1240].
- **General convex sets in $\mathbb{R}^d$:** VC-dimension is unbounded; strong $\varepsilon$-nets can be linear in $n$, but weak $\varepsilon$-nets of subexponential size in $1/\varepsilon$ exist [2104.12654].

### Lower Bounds

- For bounded VC-dimension, the logarithmic overhead is necessary [1012.1240].
- For weak nets and convex sets in $\mathbb{R}^d$, the best known lower bound is $\Omega(\varepsilon^{-1} \log^{d-1} (1/\varepsilon))$ [0812.5039].

### Small Strong ε-nets

- Existence and sharp values for net size versus $\varepsilon$ are established for boxes/rectangles, halfspaces, and disks in low dimensions, with precise staircase behavior for rectangles in the plane [1208.2785].

### Algorithmic Constructions

Deterministic constructions almost match random sampling. For disks in the plane, an algorithm yields nets of size at most $13.4/\varepsilon$ using Delaunay triangulation and recursive partitioning; practical performance is better (≈$9/\varepsilon$) [1501.03246].

## 3. Weak ε-Nets: Structure, Bounds, and Geometric Complexity

For convex ranges (unbounded VC-dimension):
- Weak $\varepsilon$-nets of subexponential size exist in fixed dimension: $O^*\left( \varepsilon^{-\alpha_d-\gamma} \right)$ with $\alpha_d < d$ for all $d\geq 3$; specifically, $\alpha_3 = 2.558$, $\alpha_4 = 3.48$, and $\alpha_d \sim d - 1/2$ for large $d$ [2104.12654].
- In the plane, the best upper bound is $O(\varepsilon^{-3/2-\gamma})$, improving the classical $O(\varepsilon^{-2})$ [1808.02686].
- Lower bounds via the "stretched grid" construction indicate a superlinear dependency on $\varepsilon^{-1}$: $\Omega(\varepsilon^{-1} \log^{d-1} (1/\varepsilon))$ [0812.5039].

Hardness:
- Verifying a weak ε-net for convex sets in $\mathbb{R}^3$ is co-NP-hard [1111.5979].

Positive-fraction intersection theorems enable $O(\varepsilon^{-2})$-size weak ε-nets for pairwise-induced families such as diametral balls and axis-aligned boxes, independent of $d$ [1506.02191].

## 4. Extensions: Weighted, t-Set, and Other Generalizations

### Weighted ε-nets

Weighted ε-nets interpolate between ε-nets and ε-approximations. For size-2 nets for convex sets (with thresholds $\alpha_1, \alpha_2$), sharp trade-offs are obtained—e.g., in $\mathbb{R}^2$, $\alpha_1 \geq 4/7$ is tight [2002.08693]. Similar explicit results exist for axis-parallel boxes.

### ε-$t$-nets and Extremal Applications

Generalized ε-nets with $t$-tuples (ε-$t$-nets) mirror classical Turán-type extremal problems, including Zarankiewicz's problem on $K_{t,t}$-free graphs. For hypergraphs of bounded VC-dimension, an ε-$t$-net of size $O((1+\log t)d/\varepsilon \cdot \log(1/\varepsilon))$ always exists [2003.07061, 2311.13662]. These structures lead to new proofs and sharp bounds for geometric incidence graphs.

## 5. Quantum, Metric, and Algorithmic Applications

- **Quantum computing:** ε-nets for unitary groups PU$(d)$ relate to approximate $t$-designs. New heat kernel–based results show that a $\delta$-approximate $t$-design is an ε-net for $\delta \gtrsim (\varepsilon/\sqrt{d})^{d^2}$, allowing more efficient quantum protocol design [2503.08577, 2007.10885].
- **Metric embeddings, distance oracles:** ε-nets for shortest-path set-systems (VC-dimension 2) yield small hitting sets and nearly optimal oracle/data-structure space for large-distance queries [1206.4164].
- **Transversal/Helly-type:** Tverberg-type theorems reinterpreted as weak ε-net statements facilitate new partition theorems for large convex intersections, with minimal dependence on ambient dimension [1711.11496].
- **Algorithmic geometric optimization:** The size of ε-nets governs approximation ratios for geometric hitting set and set cover; improvements in ε-net bounds directly translate into improved algorithmic guarantees [1501.03246].

## 6. Geometry-Dependent Improvements and Parameter Hierarchies

- Under refined measures (shallow-cell complexity, Alexander's capacity, doubling constants), ε-net sizes can be much smaller than given by VC-dimension alone; $O(\log(1/\varepsilon))$ or even $O(1)$-size nets are possible for families with low complexity [1711.10414].
- For disks, halfspaces (in $\mathbb{R}^2$ or $\mathbb{R}^3$), and pseudo-disks, optimal or near-optimal constant-factor nets exist [1410.3154, 1501.03246].
- For axis-parallel rectangles, the optimal bound is $O((1/\varepsilon)\log\log(1/\varepsilon))$ [1012.1240, 1711.10414].

## 7. Open Problems and Research Directions

- Closing the gap for weak ε-nets for convex sets: Is $O(1/\varepsilon)$ achievable in fixed dimension?
- Determining the correct exponent for the plane ($d=2$): current best $O(\varepsilon^{-3/2-\gamma})$ versus lower bounds.
- Extending hardness results for weak nets to other geometric range families and higher dimension [1111.5979].
- Designing faster, practical algorithms for constructing weak ε-nets with nearly optimal size.
- Developing ε-$t$-net theory for more complex settings and additional extremal graph applications.
- Understanding the complexity of weighted ε-nets and their role in robust geometric approximation.

---

**References:**  
- "Tighter Estimates for epsilon-nets for Disks" [1501.03246]  
- "Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions" [2104.12654]  
- "An Improved Bound for Weak Epsilon-Nets in the Plane" [1808.02686]  
- "Lower bounds for weak epsilon-nets and stair-convexity" [0812.5039]  
- "Tight lower bounds for the size of epsilon-nets" [1012.1240]  
- "When are epsilon-nets small?" [1711.10414]  
- "Small Strong Epsilon Nets" [1208.2785]  
- "Weighted Epsilon-Nets" [2002.08693]  
- "The $ε$-$t$-Net Problem" [2003.07061]  
- "Zarankiewicz's problem via $ε$-t-nets" [2311.13662]  
- "Epsilon-Nets for Halfspaces Revisited" [1410.3154]  
- "On Epsilon-Nets, Distance Oracles, and Metric Embeddings" [1206.4164]  
- "Tverberg partitions as weak epsilon-nets" [1711.11496]  
- "Positive-fraction intersection results and variations of weak epsilon-nets" [1506.02191]  
- "Epsilon-nets, unitary designs and random quantum circuits" [2007.10885]  
- "Fundamental solutions of heat equation on unitary groups establish an improved relation between $ε$-nets and approximate unitary $t$-designs" [2503.08577]

Source: https://www.emergentmind.com/topics/epsilon-nets