Answers are grounded in this paper and cite their sources.
Upper and lower bounds are given for P ( S ≤ k ), 0 ≤ k ≤ ES , where S is a sum of indicator variables with a special structure, which appears, for example, in subgraph counts in random graphs. in typical cases, these bounds are close to the corresponding probabilities for a Poisson distribution with the same mean as S . There are no corresponding general bounds for P ( S ≥ k ), k > ES , but some partial results are given.
No takes yet. Share an insight, caveat, or question.
Svante Janson (1990) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: