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…
A. Blum, T. Chan, и M. Rwebangira. Proceedings of the eigth Workshop on Algorithm Engineering and Experiments and the third Workshop on Analytic Algorithmics and Combinatorics, стр. 238--246. (2006)
R. Wetzker, C. Zimmermann, C. Bauckhage, и S. Albayrak. Proceedings of the third ACM international conference on Web search and data mining, стр. 71--80. New York, NY, USA, ACM, (2010)