Multidimensional views on mobile call network

被引:2
作者
Yang, Shengqi [1 ]
Wu, Bin [1 ]
Wang, Bai [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Comp Sci, Beijing 100876, Peoples R China
来源
FRONTIERS OF COMPUTER SCIENCE IN CHINA | 2009年 / 3卷 / 03期
基金
中国国家自然科学基金;
关键词
social network; multidimensional views; statistic properties; dynamic analysis; call graphs; communication pattern; DYNAMICS;
D O I
10.1007/s11704-009-0056-9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recent studies on social network have spurred significant interests in human behaviors. Nowadays, various kinds of interpersonal human interactions, from mobile calls to emails, provide particular avenues to explore the inherent properties of communication patterns. In this article, we present a comprehensive study on a massive anonymous call records obtained from a major mobile service operator. The important difference laid in our work and previous mainly topological analyses is that we report on multiple aspects of the dataset. By investigating the calls of the users, we find out that most calls tend to last within one minute. Call duration between two females is much longer than that of two males. But calls of males generally involve more stations than that of female, indicating a larger mobile range of the males. We also observed that people tend to communicate more with each other when they share similar characters. Besides, the network is well-connected and robust to random attack. We also demonstrate that the close-knit sub-groups with little discrepancy in the characteristics of its involved users usually evoke more calls. Another interesting discovery is that call behaviors among people between workdays and weekends is obviously distinct. Generally speaking, the goal that we research on call network through multidimensional analyses is to uncover the intricate patterns of human communications and put up reasonable insights into future service intelligence.
引用
收藏
页码:335 / 346
页数:12
相关论文
共 22 条
[1]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[2]  
[Anonymous], 2006, P 15 ACM INT C INF K
[3]  
[Anonymous], 2008, P 17 INT C WORLD WID
[4]  
Backstrom L., 2006, P 12 ACM SIGKDD INT, P44, DOI [DOI 10.1145/1150402.1150412, 10.1145/1150402.1150412]
[5]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[6]   Graph structure in the Web [J].
Broder, A ;
Kumar, R ;
Maghoul, F ;
Raghavan, P ;
Rajagopalan, S ;
Stata, R ;
Tomkins, A ;
Wiener, J .
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6) :309-320
[7]   Network robustness and fragility: Percolation on random graphs [J].
Callaway, DS ;
Newman, MEJ ;
Strogatz, SH ;
Watts, DJ .
PHYSICAL REVIEW LETTERS, 2000, 85 (25) :5468-5471
[8]  
Clauset A, 2004, PHYS REV E, V70, DOI 10.1103/PhysRevE.70.066111
[9]  
Dasgupta K., 2008, EDBT, P668
[10]  
Derenyi I, 2005, PHYS REV LETT, V94, DOI [10.1103/PhysRevLett.94.160202, DOI 10.1103/PHYS-REVLETT.94.160202]