An Analysis of Social Networks Based on Tera-Scale Telecommunication Datasets

被引:2
作者
Aksu, Hidayet [1 ]
Korpeoglu, Ibrahim [1 ]
Ulusoy, Ozgur [1 ]
机构
[1] Bilkent Univ, Dept Comp Engn, TR-06800 Ankara, Turkey
关键词
Social networks; degree analysis; call graph; empirical analysis; tera-scale dataset; BEHAVIOR; EVOLUTION; SYSTEMS; SIZE;
D O I
10.1109/TETC.2016.2627034
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the popularization of mobile phone usage, telecommunication networks have turned into a socially binding medium. Considering the traces of human communication held inside these networks, telecommunication networks are now able to provide a proxy for human social networks. To study degree characteristics and structural properties in large-scale social networks, we gathered a tera-scale dataset of call detail records that contains approximate to 5 x 107 nodes and approximate to 3.6 x 10(10) links for three GSM (mobile) networks, as well as approximate to 1.4 x 10(7) nodes and approximate to 1.9 x 10(9) links for one PSTN (fixed-line) network. In this paper, we first empirically evaluate some statistical models against the degree distribution of the country's call graph and determine that a Pareto log-normal distribution provides the best fit, despite claims in the literature that power-law distribution is the best model. We then question how network operator, size, density, and location affect degree distribution to understand the parameters governing it in social networks. Our empirical analysis indicates that changes in density, operator and location do not show a particular correlation with degree distribution; however, the average degree of social networks is proportional to the logarithm of network size. We also report on the structural properties of the communication network. These novel results are useful for managing and planning communication networks.
引用
收藏
页码:349 / 360
页数:12
相关论文
共 42 条
[1]  
Aiello W., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P171, DOI 10.1145/335305.335326
[2]   Distributed k-Core View Materialization and Maintenance for Large Dynamic Graphs [J].
Aksu, Hidayet ;
Canim, Mustafa ;
Chang, Yuan-Chi ;
Korpeoglu, Ibrahim ;
Ulusoy, Ozgur .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2014, 26 (10) :2439-2452
[3]  
Alvarez-Hamelin J. I., 2005, P EUR C COMPL SYST
[4]  
[Anonymous], 2008, P 14 ACM SIGKDD INT, DOI DOI 10.1145/1401890.1401963
[5]  
[Anonymous], 2008, P 17 INT C WORLD WID
[6]  
Bjorck A, 1996, NUMERICAL METHODS LE, DOI DOI 10.1137/1.9781611971484
[7]   A New Model for Growing Social Networks [J].
Buscarino, Arturo ;
Frasca, Mattia ;
Fortuna, Luigi ;
Fiore, Angelo Sarra .
IEEE SYSTEMS JOURNAL, 2012, 6 (03) :531-538
[8]  
Carrasco J., 2003, INT C DAT MIN MELB F
[9]   An anomaly-based approach to the analysis of the social behavior of VoIP users [J].
Chiappetta, S. ;
Mazzariello, C. ;
Presta, R. ;
Romano, S. P. .
COMPUTER NETWORKS, 2013, 57 (06) :1545-1559
[10]   Finding local community structure in networks [J].
Clauset, A .
PHYSICAL REVIEW E, 2005, 72 (02)