Erdős–Rényi model

There are two closely related variants of the Erdős–Rényi random graph model.

A graph generated by the binomial model of Erdős and Rényi (p = 0.01)

• In the G(n, M) model, a graph is chosen uniformly at random from the collection of all graphs which have n nodes and M edges. For example, in the G(3, 2) model, each of the three possible graphs on three vertices and two edges are included with probability 1/3.
• In the G(n, p) model, a graph is constructed by connecting nodes randomly. Each edge is included in the graph with probability p independent from every other edge. Equivalently, all graphs with n nodes and M edges have equal probability of

${\displaystyle p^{M}(1-p)^{{n \choose 2}-M}.}$

The parameter p in this model can be thought of as a weighting function; as p increases from 0 to 1, the model becomes more and more likely to include graphs with more edges and less and less likely to include graphs with fewer edges. In particular, the case p = 0.5 corresponds to the case where all ${\displaystyle 2^{\binom {n}{2}}}$ graphs on n vertices are chosen with equal probability.

The behavior of random graphs are often studied in the case where n, the number of vertices, tends to infinity. Although p and M can be fixed in this case, they can also be functions depending on n. For example, the statement

Almost every graph in G(n, 2ln(n)/n) is connected.

means

As n tends to infinity, the probability that a graph on n vertices with edge probability 2ln(n)/n is connected, tends to 1.

The expected number of edges in G(n, p) is ${\displaystyle {\tbinom {n}{2}}p}$, and by the law of large numbers any graph in G(n, p) will almost surely have approximately this many edges (provided the expected number of edges tends to infinity). Therefore, a rough heuristic is that if pn² → ∞, then G(n,p) should behave similarly to G(n, M) with ${\displaystyle M={\tbinom {n}{2}}p}$ as n increases.

For many graph properties, this is the case. If P is any graph property which is monotone with respect to the subgraph ordering (meaning that if A is a subgraph of B and A satisfies P, then B will satisfy P as well), then the statements "P holds for almost all graphs in G(n, p)" and "P holds for almost all graphs in ${\displaystyle G(n,{\tbinom {n}{2}}p)}$" are equivalent (provided pn² → ∞). For example, this holds if P is the property of being connected, or if P is the property of containing a Hamiltonian cycle. However, this will not necessarily hold for non-monotone properties (e.g. the property of having an even number of edges).

In practice, the G(n, p) model is the one more commonly used today, in part due to the ease of analysis allowed by the independence of the edges.

With the notation above, a graph in G(n, p) has on average ${\displaystyle {\tbinom {n}{2}}p}$ edges. The distribution of the degree of any particular vertex is binomial:[4]

${\displaystyle P(\deg(v)=k)={n-1 \choose k}p^{k}(1-p)^{n-1-k},}$

where n is the total number of vertices in the graph. Since

${\displaystyle P(\deg(v)=k)\to {\frac {(np)^{k}\mathrm {e} ^{-np}}{k!}}\quad {\text{ as }}n\to \infty {\text{ and }}np={\text{constant}},}$

this distribution is Poisson for large n and np = const.

In a 1960 paper, Erdős and Rényi[5] described the behavior of G(n, p) very precisely for various values of p. Their results included that:

• If np < 1, then a graph in G(n, p) will almost surely have no connected components of size larger than O(log(n)).
• If np = 1, then a graph in G(n, p) will almost surely have a largest component whose size is of order n^2/3.
• If np → c > 1, where c is a constant, then a graph in G(n, p) will almost surely have a unique giant component containing a positive fraction of the vertices. No other component will contain more than O(log(n)) vertices.
• If ${\displaystyle p<{\tfrac {(1-\varepsilon )\ln n}{n}}}$, then a graph in G(n, p) will almost surely contain isolated vertices, and thus be disconnected.
• If ${\displaystyle p>{\tfrac {(1+\varepsilon )\ln n}{n}}}$, then a graph in G(n, p) will almost surely be connected.

Thus ${\displaystyle {\tfrac {\ln n}{n}}}$ is a sharp threshold for the connectedness of G(n, p).

Further properties of the graph can be described almost precisely as n tends to infinity. For example, there is a k(n) (approximately equal to 2log₂(n)) such that the largest clique in G(n, 0.5) has almost surely either size k(n) or k(n) + 1.[6]

Thus, even though finding the size of the largest clique in a graph is NP-complete, the size of the largest clique in a "typical" graph (according to this model) is very well understood.

Edge-dual graphs of Erdos-Renyi graphs are graphs with nearly the same degree distribution, but with degree correlations and a significantly higher clustering coefficient.[7]

In percolation theory one examines a finite or infinite graph and removes edges (or links) randomly. Thus the Erdős–Rényi process is in fact unweighted link percolation on the complete graph. (One refers to percolation in which nodes and/or links are removed with heterogeneous weights as weighted percolation). As percolation theory has much of its roots in physics, much of the research done was on the lattices in Euclidean spaces. The transition at np = 1 from giant component to small component has analogs for these graphs, but for lattices the transition point is difficult to determine. Physicists often refer to study of the complete graph as a mean field theory. Thus the Erdős–Rényi process is the mean-field case of percolation.

Some significant work was also done on percolation on random graphs. From a physicist's point of view this would still be a mean-field model, so the justification of the research is often formulated in terms of the robustness of the graph, viewed as a communication network. Given a random graph of n ≫ 1 nodes with an average degree <k>. Remove randomly a fraction 1 − p′ of nodes and leave only a fraction p′ from the network. There exists a critical percolation threshold ${\displaystyle p'_{c}={\tfrac {1}{\langle k\rangle }}}$ below which the network becomes fragmented while above ${\displaystyle p'_{c}}$ a giant connected component of order n exists. The relative size of the giant component, P_∞, is given by[5][1][2][8]

${\displaystyle P_{\infty }=p'[1-\exp(-\langle k\rangle P_{\infty })].\,}$

Both of the two major assumptions of the G(n, p) model (that edges are independent and that each edge is equally likely) may be inappropriate for modeling certain real-life phenomena. Erdős–Rényi graphs have low clustering, unlike many social networks. Some modeling alternatives include Barabási–Albert model and Watts and Strogatz model. These alternative models are not percolation processes, but instead represent a growth and rewiring model, respectively. A model for interacting Erdős–Rényi networks was developed recently by Buldyrev et al.[9]

The G(n, p) model was first introduced by Edgar Gilbert in a 1959 paper studying the connectivity threshold mentioned above.[3] The G(n, M) model was introduced by Erdős and Rényi in their 1959 paper. As with Gilbert, their first investigations were as to the connectivity of G(n, M), with the more detailed analysis following in 1960.

• Rado graph – infinite graph containing all countable graphs, the graph formed by extending the G(n, p) model to graphs with a countably infinite number of vertices. Unlike in the finite case, the result of this infinite process is (with probability 1) the same graph, up to isomorphism.
• Dual-phase evolution – A process that drives self-organization within complex adaptive systems describes ways in which properties associated with the Erdős–Rényi model contribute to the emergence of order in systems.
• Exponential random graph models describe a general probability distribution of graphs on "n" nodes given a set of network statistics and various parameters associated with them.
• Stochastic block model, a generalization of the Erdős–Rényi model for graphs with latent community structure
• Watts–Strogatz model
• Barabási–Albert model

• West, Douglas B. (2001). Introduction to Graph Theory (2nd ed.). Prentice Hall. ISBN 0-13-014400-2.
• Newman, M. E. J. (2010). Networks: An Introduction. Oxford.
• Reuven Cohen and Shlomo Havlin (2010). Complex Networks: Structure, Robustness and Function. Cambridge University Press.