A practical simulation method for social networks

Authors:
Rui Zeng;Quan Z. Sheng;Lina Yao;Tianwei Xu;Dong Xie
Affiliations:
Yunnan Normal University, Kunming, China;The University of Adelaide, Adelaide, SA, Australia;The University of Adelaide, Adelaide, SA, Australia;Yunnan Normal University, Kunming, China;Hunan University of Humanities
Venue:
AWC '13 Proceedings of the First Australasian Web Conference - Volume 144
Year:
2013

Citing 7
Cited 0

Clique partitions, graph compression and speeding-up algorithms

Journal of Computer and System Sciences
Advances to Bayesian network inference for generating causal networks from observational biological data

Bioinformatics
Preferential deletion in dynamic models of web-like networks

Information Processing Letters
The link-prediction problem for social networks

Journal of the American Society for Information Science and Technology
Metropolis Algorithms for Representative Subgraph Sampling

ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Simulation of scale-free networks

Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Using Modeling and Simulation to Evaluate Enterprises' Risk Exposure to Social Networks

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, inter-nodes' 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.