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…
Z. Baida, H. Akkermans, and J. Gordijn. ICEC '03: Proceedings of the 5th international conference on Electronic commerce, page 111--118. New York, NY, USA, ACM, (2003)