(2) Erd˝os and R´enyi (1960) studied a model of growth for graphs in which, at each step, two nodes are chosen uniformly at random and a link is inserted between them. Do you think power laws and the rich-get-richer phenomena are likely to be observed in these random graphs. Provide a brief explanation for your answer
A graph is chosen random manner from a set of all graphs with n nodes and e edges in the G(n, e) model. In the G(3, 2) model, for example, each of the three potential graphs with three vertices and two edges is included with 1/3 chance.
A graph is created in the G(n, e) model by linking nodes at random. Individual edge exist in the graph with a probability of p, which is independent of the probability of the other edges. In other words, all graphs with n nodes and e edges have an identical chance of succeeding.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
