- #1
John Creighto
- 495
- 2
I also posted the following question on wikipedia:
http://en.wikipedia.org/wiki/Talk:Erdős–Rényi_model
According to:
And in the main article it says: "Properties of G(n, p)
As mentioned above, a graph in G(n, p) has on average \tbinom{n}{2} p edges. The distribution of the degree of any particular vertex is binomial:"
Am I right to assume that it is the G(n, M) model which has a poisson distribution or did I miss something or is there a mistake. As a general comment the main article seems to focus mainly on the G(n, M) model with little discussion on the G(n, p) model.
S243a (talk) 21:45, 4 July 2009 (UTC)John Creighton
http://en.wikipedia.org/wiki/Talk:Erdős–Rényi_model
According to:
http://en.wikipedia.org/wiki/Watts_and_Strogatz_model#Rationale_for_the_modelThey do not account for the formation of hubs. Formally, the degree distribution of ER graphs converges to a Poisson distribution, rather than a power law observed in most real-world, scale-free networks.
And in the main article it says: "Properties of G(n, p)
As mentioned above, a graph in G(n, p) has on average \tbinom{n}{2} p edges. The distribution of the degree of any particular vertex is binomial:"
Am I right to assume that it is the G(n, M) model which has a poisson distribution or did I miss something or is there a mistake. As a general comment the main article seems to focus mainly on the G(n, M) model with little discussion on the G(n, p) model.
S243a (talk) 21:45, 4 July 2009 (UTC)John Creighton