In the field of social community detection, it is commonly accepted to utilize graphs with reference community structure for accuracy evaluation. The method for generating large random social graphs with realistic community structure is introduced in the paper. The resulting graphs have several of recently discovered properties of social community structure which run counter to conventional wisdom: dense community overlaps, superlinear growth of number of edges inside a community with its size, and power law distribution of user-community memberships. Further, the method is by-design distributable and showed near-linear scalability in Amazon EC2 cloud using Apache Spark implementation. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Chykhradze, K., Korshunov, A., Buzun, N., Pastukhov, R., Kuzyurin, N., Turdakov, D., & Kim, H. (2014). Distributed generation of billion-node social graphs with overlapping community structure. In Studies in Computational Intelligence (Vol. 549, pp. 199–208). Springer Verlag. https://doi.org/10.1007/978-3-319-05401-8_19
Mendeley helps you to discover research relevant for your work.