Talk:Erdős–Rényi model

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Mid	This article has been rated as Mid-priority on the project's priority scale.

Statistics Low‑importance

	This article is within the scope of WikiProject Statistics, a collaborative effort to improve the coverage of statistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.StatisticsWikipedia:WikiProject StatisticsTemplate:WikiProject StatisticsStatistics articles
Low	This article has been rated as Low-importance on the importance scale.

According to: They 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. http://en.wikipedia.org/wiki/Watts_and_Strogatz_model#Rationale_for_the_model

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[reply]

After some thought it seems to be the case that if there are at least 10 times as many nodes as the average order then the Poisson distribution is a suitable approximation even though the underlying statistics are binomial. Given that in most areas of social science the number of nodes is large in comparison to the order then Poisson statistics usually are appropriate.

S243a (talk) 00:54, 5 July 2009 (UTC)John Creighton[reply]

Abbreviations[edit]

I find this just a little bit too much: "Magyar Tud. Akad. Mat. Kutató Int. Közl." Can anyone tell me what that stands for? Abbreviations in references made sense when paper was expensive. But do abbreviations to the point of impossible-to-understand really belong in Wikipedia?

To answer my own question, I had some luck finding the paper on this page http://www.renyi.hu/~p_erdos/Erdos.html (#1960-10). The expansion of the abbreviated text appears to be "A Matematikai Kutat\'{o} Int\'{e}zet K\"{o}lem\'{e}nyei" (as according to http://www.citeulike.org/user/muraken/article/4012385), and in English that seems to be translated (and abbreviated!) as "Publ. Math. Inst. Hungar. Acad. Sci" (as according to http://www.citeulike.org/group/3072/article/1666220 and http://mathworld.wolfram.com/RandomGraph.html).

Spectrum?[edit]

Article enhancement request: what is the spectrum of these graphs? How does it compare to that of scale-free graphs? linas (talk) 18:47, 24 March 2010 (UTC)[reply]

Hi Linas, You may be interested in this: http://arxiv.org/abs/cond-mat/0102335 --fij (talk) 13:58, 13 July 2010 (UTC)[reply]

asymptotically almost surely[edit]

I think would be better to substitute "almost surely" with "asymptotically almost surely" as here.--Natematic (talk) 19:54, 7 October 2012 (UTC)[reply]

Interacting Erdős–Rényi random graphs model[edit]

The author decided to distinguish matrices from matrix elements by boldfacing. This is not documented in wp:MSM; I find this convention confusing so I edited the descriptions to be more explicit (while keeping the original style). --Yecril (talk) 15:03, 2 March 2014 (UTC)[reply]

Merge with Evolution of a random network[edit]

The following discussion is closed. Please do not modify it. Subsequent comments should be made in a new section. A summary of the conclusions reached follows.

To not merge on the grounds that the topics are independently notable and distinct. Klbrain (talk) 21:12, 2 April 2021 (UTC)[reply]

The two articles seem to present results from the same model. Biggerj1 (talk) 15:04, 28 August 2020 (UTC)[reply]

This article is on the model itself. The other article is on a mathematical phenomenon that occurs for a very specific range of parameters of this model and that also occurs for some other related models. It would be stupid to do the merge you propose, from this article into the other one. It would be like merging automobile into speedometer. —David Eppstein (talk) 17:08, 28 August 2020 (UTC)[reply]

I also do not think the proposed merge is a good idea. —JBL (talk) 13:23, 29 August 2020 (UTC)[reply]

Yes, the merge would be a step in the wrong direction, I think. Also, Evolution of a random network contains substantial copying from one of Barabasi's books; even if this isn't technically copyvio due to the licensing, it's still poor form, resulting at best in unencyclopedic tone. XOR'easter (talk) 22:05, 29 August 2020 (UTC)[reply]

"It would be like merging automobile into speedometer", well if you just go by the lemmas, then yes - but the results presented in Evolution of a random network seem to mainly arise from the Erdős–Rényi model at least these sections (1 Conditions for emergence of a giant component 2 Regimes of evolution of a random network, 2.1 Subcritical Regime, 2.2 Critical Point, 2.3 Supercritical Regime, 2.4 Connected Regime), therefore they could very well be presented in this article. The article "Evolution of a random network" would then need to link to Erdős–Rényi model for details and present other models as well. --2A01:C23:7809:B00:65E6:1B82:2148:ABF8 (talk) 20:37, 5 December 2020 (UTC)[reply]

The discussion above is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.