Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs (Q2431088): Difference between revisions

On a finite ground set of size \(N\), a random subset is selected that independently includes each element with the same probability \(p=p(N)\). Tail probabilities are estimated for the number of members of a given family of subsets that are included in the random subset. Close bounds are given for upper tail probabilities of edge counts in random hypergraphs. Applications to partition properties of random subsets of integers are considered. Rooted subgraphs of random graphs are investigated.