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…
B. Yu, und M. Singh. Cooperative Information Agents IV - The Future of Information Agents in Cyberspace, Volume 1860 von Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, (2000)