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…
S. Doerfel, R. Jäschke, и G. Stumme. Formal Concept Analysis - 10th International Conference, ICFCA 2012, Leuven, Belgium, May 7-10, 2012. Proceedings, том 7278 из Lecture Notes in Computer Science, стр. 77-95. Berlin/Heidelberg, Springer, (2012)
S. Doerfel, R. Jäschke, и G. Stumme. Formal Concept Analysis, том 7278 из Lecture Notes in Artificial Intelligence, стр. 77--95. Berlin/Heidelberg, Springer, (мая 2012)
S. Papadopoulos, Y. Kompatsiaris, и A. Vakali. Proceedings of the 12th international conference on Data warehousing and knowledge discovery, стр. 65--76. Berlin, Heidelberg, Springer-Verlag, (2010)