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. Atzmueller, und F. Mitzlaff. Lorentz Workshop on Mining Patterns and Subgroups, Lorentz Center, Leiden, The Netherlands. Awarded with the Best Discovery Award, (2010)