A Practical Simulation Method for Social Networks

Zeng, R., Sheng, Q.Z., Yao, L., Xu, T. and Xie, D.

    With the increasing popularity of social networks, it is becoming more and more crucial for the decision makers to analyze and understand the evolution of these networks in order to identify e.g., potential business opportunities. Unfortunately, understanding social networks, which are typically complex and dynamic, is not an easy task. In this paper, we propose an effective and practical approach for simulating social networks. We first develop a social network model that considers the addition and deletion of nodes and edges. We consider the nodes’ in-degree, internodes’ close degree, which indicates how close the nodes are in the social network, and the limit of the network size in the social network model. We then develop a graph-based stratified random sampling algorithm for generating an initial network. To obtain the snapshots of a social network of the past, current and the future, we further develop a close degree algorithm and a close degree of estimation algorithm. The degree distribution of our model follows a power-law distribution with a “fat-tail”. Experimental results using real-life social networks show the effectiveness of our proposed simulation method.
Cite as: Zeng, R., Sheng, Q.Z., Yao, L., Xu, T. and Xie, D. (2013). A Practical Simulation Method for Social Networks. In Proc. The Web 2013 (AWC 2013) Adelaide, Australia. CRPIT, 144. Ashman, H., Sheng, Q.Z. and Trotman, A. Eds., ACS. 27-34
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS