 Erdős–Rényi model

In the $G(n,p)$ model, each of the $\left(\genfrac{}{}{0ex}{}{n}{2}\right)$ possible edges is included independently with probability $p$.

The Erdős–Rényi model is a foundational concept in the field of network theory, specifically in the study of random graphs. Developed by mathematicians Paul Erdős and Alfréd Rényi in the late 1950s, this model provides a simple framework for understanding how graphs can form randomly under certain conditions.