Erdős–Rényi
The Erdős–Rényi model is a foundational concept in graph theory, introduced by mathematicians Paul Erdős and Alfréd Rényi in the late 1950s. It describes how random graphs are formed by connecting a set of vertices with edges. In this model, each possible edge between pairs of vertices is included with a fixed probability, leading to various graph structures.
This model is significant for studying the properties of networks, such as connectivity and the emergence of clusters. It serves as a basis for understanding more complex networks found in real-world systems, including social networks and biological systems.