Sprinkling of a binomial random graph
= Sprinkling of a binomial random graph
Sprinkling exposes independent rounds $G(n,p_1),\ldots,G(n,p_k)$. Their union has distribution $G(n,p)$ where
$$
1-p=\prod_{i=1}^k(1-p_i).
$$
= Sprinkling of a binomial random graph
Sprinkling exposes independent rounds $G(n,p_1),\ldots,G(n,p_k)$. Their union has distribution $G(n,p)$ where
$$
1-p=\prod_{i=1}^k(1-p_i).
$$