Abstract
Motivated by the Beck-Fiala conjecture, we study discrepancy bounds for random sparse set systems. Concretely, these are set systems (X,Σ), where each element x ∈ X lies in t randomly selected sets of Σ, where t is an integer parameter. We provide new bounds in two regimes of parameters. We show that when |Σ| ≥ |X| the hereditary discrepancy of (X,Σ) is with high probability (Formula presented.); and when |X| ≫ |Σ|t the hereditary discrepancy of (X,Σ) is with high probability O(1). The first bound combines the Lovász Local Lemma with a new argument based on partial matchings; the second follows from an analysis of the lattice spanned by sparse vectors.
Original language | English |
---|---|
Pages (from-to) | 665-675 |
Number of pages | 11 |
Journal | Random Structures and Algorithms |
Volume | 54 |
Issue number | 4 |
DOIs | |
State | Published - Jul 2019 |
Keywords
- beck-fiala conjecture
- discrepancy theory
- random set systems
All Science Journal Classification (ASJC) codes
- Software
- General Mathematics
- Computer Graphics and Computer-Aided Design
- Applied Mathematics