Random graphs are mathematical structures used to model networks where connections between nodes are formed randomly. In a random graph, each possible edge between a pair of nodes is included with a certain probability, leading to a variety of possible configurations. This randomness helps researchers understand the properties of complex networks, such as social networks or the internet. One of the most studied types of random graphs is the Erdős–Rényi model, where a fixed number of nodes is connected by edges that are randomly assigned. This model provides insights into phenomena like connectivity, clustering, and the emergence of large-scale structures in various fields, including computer science and biology.