ε-net
An -net describes several related concepts in mathematics.
Let be a probability distribution over some set . An -net for a class of subsets of is any subset such that for any
Intuitively approximates the probability distribution.
A stronger notion is -approximation. An -approximation for class is subset such that for any it holds

Let X be a set and R be a set of subsets of X; such a pair is called a range space or hypergraph, and the elements of R are called ranges or hyperedges. An ε-net of a subset P of X is a subset N of P such that any range r ∈ R with |r ∩ P| ≥ ε|P| intersects N.[1] In other words, any range that intersects at least a proportion ε of the elements of P must also intersect N.
For example, suppose X is the set of points, R is the set of closed filled rectangles in the plane, and P is the unit square [0,1] × [0,1]. Then the set R consisting of the 8 points shown in the diagram to the right is a 1/4-net of P, because any closed filled rectangle intersecting at least 1/4 of the unit square must intersect one of these points.
For any range space with finite VC dimension d, regardless of the choice of P and ɛ, there exists an ɛ-net of P of size ; because the size of this set is independent of P, any set P can be described using a set of fixed size. This facilitates the development of efficient approximation algorithms.
In set theory, an ɛ-net is a set of points in a metric space such that each point of the space is within distance ɛ of some point in the set. For example, the integers are an ɛ-net of the real numbers for any ɛ > 0.5.
This should not be confused with the concept of a net, which is equivalent to a sequence in a metric space.
References
- ^ D. Haussler and E. Welzl. ε-nets and simplex range queries. Discrete Computational Geometry, 2:127–151, 1987.