Most networks, such as those generated from social media, tend to evolve gradually with frequent changes in the activity and the interactions of their participants. Furthermore, the communities inside the network can grow, shrink, merge, or split, and the entities can move from one community to another. The aim of community detection methods is precisely to detect the evolution of these communities. However, evaluating these algorithms requires tests on real or artificial networks with verifiable ground truth. Dynamic networks generators have been recently proposed for this task, but most of them consider only the structure of the network, disregarding the characteristics of the nodes. In this paper, we propose a new generator for dynamic attributed networks with community structure that follow the properties of real-world networks. The evolution of the network is performed using two kinds of operations: Micro-operations are applied on the edges and vertices, while macro-operations on the communities. Moreover, the properties of real-world networks such as preferential attachment or homophily are preserved during the evolution of the network, as confirmed by our experiments.
Social network Graph generator Community structure
This is a preview of subscription content, log in to check access.
Akoglu L, Faloutsos C (2009) RTG: a recursive realistic graph generator using random typing. Data Min Knowl Discov 19(2):194–209MathSciNetCrossRefGoogle Scholar
Akoglu L et al (2008) RTM: laws and a recursive generator for weighted time-evolving graphs. In: Eighth IEEE international conference on data mining, 2008 (ICDM’08). IEEE, pp 701–706Google Scholar
Benson AR et al (2014) Learning multifractal structure in large networks. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 1326–1335Google Scholar
Gong NZ et al (2012) Evolution of social-attribute networks: measurements, modeling, and implications using Google+. In: ACM conference on internet measurement conference (IMC). ACM, pp 131–144Google Scholar
Leskovec J et al (2005b) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. ACM, pp 177–187Google Scholar
McPherson M et al (2001) Birds of a feather: homophily in social networks. Annu Rev Sociol 27(1):415–444CrossRefGoogle Scholar
Milgram S (1967) The small-world problem. Psychol Today 2:60–67Google Scholar
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113CrossRefGoogle Scholar
Palla G et al (2010) Multifractal network generator. Proc Natl Acad Sci 107(17):7640–7645CrossRefGoogle Scholar
Pfeiffer JJ III et al (2014) Attributed graph models: modeling network structure with correlated attributes. In: Proceedings of the 23rd international conference on World Wide Web. ACM, pp 831–842Google Scholar
Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393(6684):440–442CrossRefGoogle Scholar