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…
M. Grahl, A. Hotho, и G. Stumme. Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007), стр. 50-54. Martin-Luther-Universität Halle-Wittenberg, (сентября 2007)
N. Du, B. Wu, X. Pei, B. Wang, и L. Xu. WebKDD/SNA-KDD '07: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis, стр. 16--25. New York, NY, USA, ACM, (2007)
G. Flake, S. Lawrence, и C. Giles. KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, стр. 150--160. New York, NY, USA, ACM Press, (2000)