Abstract
Given a hypergraph $\Gamma =(\Omega ,\mathcal{X})$ and a sequence $\mathbf{p}=(p_{\omega })_{\omega \in \Omega }$ of values in $(0,1)$, let $\Omega_{\mathbf{p}}$ be the random subset of $\Omega $ obtained by keeping every vertex $\omega $ independently with probability $p_{\omega }$. We investigate the general question of deriving fine (asymptotic) estimates for the probability that $\Omega_{\mathbf{p}}$ is an independent set in $\Gamma $, which is an omnipresent problem in probabilistic combinatorics. Our main result provides a sequence of upper and lower bounds on this probability, each of which can be evaluated explicitly in terms of the joint cumulants of small sets of edge indicator random variables. Under certain natural conditions, these upper and lower bounds coincide asymptotically, thus giving the precise asymptotics of the probability in question. We demonstrate the applicability of our results with two concrete examples: subgraph containment in random (hyper)graphs and arithmetic progressions in random subsets of the integers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.