Random graphs are graphs that are produced using probabilistic rules. For example, the edges that are present or the number of vertices that are part of the graph are determined by performing a chance experiment. The idea behind this can be that people meet each other in an unpredictable way, and thus the precise connections that exist could be seen as the outcome of a chance experiment.
On the Network Pages, we describe several random graph models that have been used to model real-world networks, such as the Erdös-Rényi random graph, the configuration model, and preferential attachment models.
Would you like to stay up to date whenever a new post appears on the Network Pages? Then subscribe to our mailing list, follow us on Twitter or on LinkedIn.