It has long been known that classical Erdös-Renyi random graphs are rather limited in the types of degree distributions they can produce. The degree of any given node follows a binomial distribution, which goes over into a Poisson distribution in the sparse limit. In contrast, many real-world networks possess power law degree sequences that would…
Y. Han, and J. Tang. Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, page 407--416. New York, NY, USA, ACM, (2015)
A. Sonnenbichler. (2010)cite arxiv:1006.4271
Comment: Presented at the International Network For Social Network Analysis
(INSNA): Sunbelt Conference 2009, San Diego, California, USA. 9 pages, 6
figures.