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…
Y. Han, und J. Tang. Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seite 407--416. New York, NY, USA, ACM, (2015)
J. Scripps, P. Tan, und A. Esfahanian. Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, Seite 26--35. New York, NY, USA, ACM, (2007)
A. Mislove, B. Viswanath, K. Gummadi, und P. Druschel. Proceedings of the Third ACM International Conference on Web Search and Data Mining, Seite 251--260. New York, NY, USA, ACM, (2010)
J. Yang, und J. Leskovec. Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, Seite 587--596. New York, NY, USA, ACM, (2013)
I. Kloumann, und J. Kleinberg. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seite 1366--1375. New York, NY, USA, ACM, (2014)
F. Mitzlaff, M. Atzmueller, D. Benz, A. Hotho, und G. Stumme. Analysis of Social Media and Ubiquitous Data, Volume 6904 von Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2011)
C. Giatsidis, D. Thilikos, und M. Vazirgiannis. Advances in Social Networks Analysis and Mining (ASONAM), 2011 International Conference on, Seite 87-93. (2011)
F. Mitzlaff, M. Atzmueller, D. Benz, A. Hotho, und G. Stumme. Analysis of Social Media and Ubiquitous Data, Volume 6904 von Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2011)