On the discrepancy of random low degree set systems
From MaRDI portal
Abstract: Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are elements and sets and each element lies in randomly chosen sets. In this setting, Ezra and Lovett showed an discrepancy bound in the regime when and an bound when . In this paper, we give a tight bound for the entire range of and , under a mild assumption that . The result is based on two steps. First, applying the partial coloring method to the case when and using the properties of the random set system we show that the overall discrepancy incurred is at most . Second, we reduce the general case to that of using LP duality and a careful counting argument.
Recommendations
Cited in
(12)- On the Beck-Fiala theorem
- On the Beck-Fiala conjecture for random set systems
- On the discrepancy of random matrices with many columns
- On the Beck-Fiala conjecture for random set systems
- A Fourier-analytic approach for the discrepancy of random set systems
- On the discrepancy of random low degree set systems
- An improvement of the Beck-Fiala theorem
- The Phase Transition of Discrepancy in Random Hypergraphs
- The discrepancy of random rectangular matrices
- Critical window of the symmetric perceptron
- Zero-one laws for random feasibility problems
- Weaver's discrepancy for Gaussian random vectors
This page was built for publication: On the discrepancy of random low degree set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136929)