The Phase Transition of Discrepancy in Random Hypergraphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913191594819584 |
|---|---|
| author | MacRury, Calum Masařík, Tomáš Pai, Leilani Pérez-Giménez, Xavier |
| author_facet | MacRury, Calum Masařík, Tomáš Pai, Leilani Pérez-Giménez, Xavier |
| contents | Motivated by the Beck-Fiala conjecture, we study the discrepancy problem in two related models of random hypergraphs on $n$ vertices and $m$ edges. In the first (edge-independent) model, a random hypergraph $H_1$ is constructed by fixing a parameter $p$ and allowing each of the $n$ vertices to join each of the $m$ edges independently with probability $p$. In the parameter range in which $pn \rightarrow \infty$ and $pm \rightarrow \infty$, we show that with high probability (w.h.p.) $H_1$ has discrepancy at least $Ω(2^{-n/m} \sqrt{pn})$ when $m = O(n)$, and at least $Ω(\sqrt{pn \logγ})$ when $m \gg n$, where $γ= \min\{ m/n, pn\}$. In the second (edge-dependent) model, $d$ is fixed and each vertex of $H_2$ independently joins exactly $d$ edges uniformly at random. We obtain analogous results for this model by generalizing the techniques used for the edge-independent model with $p=d/m$. Namely, for $d \rightarrow \infty$ and $dn/m \rightarrow \infty$, we prove that w.h.p. $H_{2}$ has discrepancy at least $Ω(2^{-n/m} \sqrt{dn/m})$ when $m = O(n)$, and at least $Ω(\sqrt{(dn/m) \logγ})$ when $m \gg n$, where $γ=\min\{m/n, dn/m\}$. Furthermore, we obtain nearly matching asymptotic upper bounds on the discrepancy in both models (when $p=d/m$), in the dense regime of $m \gg n$. Specifically, we apply the partial colouring lemma of Lovett and Meka to show that w.h.p. $H_{1}$ and $H_{2}$ each have discrepancy $O( \sqrt{dn/m} \log(m/n))$, provided $d \rightarrow \infty$, $d n/m \rightarrow \infty$ and $m \gg n$. This result is algorithmic, and together with the work of Bansal and Meka characterizes how the discrepancy of each random hypergraph model transitions from $Θ(\sqrt{d})$ to $o(\sqrt{d})$ as $m$ varies from $m=Θ(n)$ to $m \gg n$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2102_07342 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | The Phase Transition of Discrepancy in Random Hypergraphs MacRury, Calum Masařík, Tomáš Pai, Leilani Pérez-Giménez, Xavier Combinatorics Discrete Mathematics Motivated by the Beck-Fiala conjecture, we study the discrepancy problem in two related models of random hypergraphs on $n$ vertices and $m$ edges. In the first (edge-independent) model, a random hypergraph $H_1$ is constructed by fixing a parameter $p$ and allowing each of the $n$ vertices to join each of the $m$ edges independently with probability $p$. In the parameter range in which $pn \rightarrow \infty$ and $pm \rightarrow \infty$, we show that with high probability (w.h.p.) $H_1$ has discrepancy at least $Ω(2^{-n/m} \sqrt{pn})$ when $m = O(n)$, and at least $Ω(\sqrt{pn \logγ})$ when $m \gg n$, where $γ= \min\{ m/n, pn\}$. In the second (edge-dependent) model, $d$ is fixed and each vertex of $H_2$ independently joins exactly $d$ edges uniformly at random. We obtain analogous results for this model by generalizing the techniques used for the edge-independent model with $p=d/m$. Namely, for $d \rightarrow \infty$ and $dn/m \rightarrow \infty$, we prove that w.h.p. $H_{2}$ has discrepancy at least $Ω(2^{-n/m} \sqrt{dn/m})$ when $m = O(n)$, and at least $Ω(\sqrt{(dn/m) \logγ})$ when $m \gg n$, where $γ=\min\{m/n, dn/m\}$. Furthermore, we obtain nearly matching asymptotic upper bounds on the discrepancy in both models (when $p=d/m$), in the dense regime of $m \gg n$. Specifically, we apply the partial colouring lemma of Lovett and Meka to show that w.h.p. $H_{1}$ and $H_{2}$ each have discrepancy $O( \sqrt{dn/m} \log(m/n))$, provided $d \rightarrow \infty$, $d n/m \rightarrow \infty$ and $m \gg n$. This result is algorithmic, and together with the work of Bansal and Meka characterizes how the discrepancy of each random hypergraph model transitions from $Θ(\sqrt{d})$ to $o(\sqrt{d})$ as $m$ varies from $m=Θ(n)$ to $m \gg n$. |
| title | The Phase Transition of Discrepancy in Random Hypergraphs |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2102.07342 |