DOI QR코드

DOI QR Code

Constructing a Social Contact Network based on Cellphone Call Records and Analysis of its Scale-free Property

휴대폰 통화기록 기반의 소셜 컨택 네트워크 구성 및 Scale-free 특성에 관한 분석

  • Lee, Jinho (Department of Management Science, Korea Naval Academy)
  • 이진호 (해군사관학교 경영과학과)
  • Received : 2013.11.13
  • Accepted : 2014.01.19
  • Published : 2014.02.15

Abstract

We consider a human contact social network that has connections through cellphone addresses. To construct such a social network, we use real call records provided by a large carrier, and connect to each other if there exists a call record between any two cellphone users. Due to its huge amount of data, we down-sample it in a way that the smallest-degree nodes are removed, in turn, from the network. For a moderate size of the networks we show that the degree distribution of the network follows a power-law distribution via linear regression analysis, implying the so-called scale-free property. We finally suggest some alternative measures to analyze a social network.

Keywords

References

  1. Adamic, L. A. and Huberman, B. A. (2000), Power-law distribution of the World Wide Web, Science, 287, 2115. https://doi.org/10.1126/science.287.5461.2115a
  2. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1994), Network Flows : Theory, Algorithms, and Applications, Prentice Hall, New Jersey, USA.
  3. Alderson, D. L. (2008), Catching the "network science" bug : Insight and opportunity for the operations researcher, Operations Research, 56, 1047-1065. https://doi.org/10.1287/opre.1080.0606
  4. Alvarez-Hamelin, J. I., Dall'Asta, L., Barrat, A., and Vespignani, A. (2008), K-core decomposition of internet graphs : Hierarchies, self-similarity and measurement biases, Network and Heterogeneous Media, 3, 371-393. https://doi.org/10.3934/nhm.2008.3.371
  5. Balthrop, J., Forrest, S., Newman, M. E. J., and Williamson, M. M. (2004), Technological networks and the spread of computer viruses, Science, 304, 527-529. https://doi.org/10.1126/science.1095845
  6. Barabasi, A. L. and Albert, R. (1999), Emergence of scaling in random networks, Science, 286, 509-512. https://doi.org/10.1126/science.286.5439.509
  7. Chen, W., Wang, Y., and Yang, S. (2009), Efficient influence maximization in social networks, Proc. 15th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, Paris, France.
  8. Chung, F. R. K. (1997), Spectral Graph Theory, American Mathematical Society, Rhode Island, USA.
  9. Dimitrov, N. B. and Meyers, L. A. (2010), Mathematical approaches to infectious disease prediction and control, Tutorials in Operations Research, INFORMS, 1-25.
  10. Fleizach, C., Liljenstam, M., Johansson, P., Voelker, G. M. and Mehas, A. (2007), Can you infect me now? Malware propagation in mobile phone networks, Proc. 2007 ACM Workshop on Recurring Malcode.
  11. Hochbaum, D. (2010), Replacing spectral techniques for expander ratio, normalized cut and conductance by combinatorial flow algorithms, arXiv, 1010.4535.
  12. Kempe, D., Kleinberg, J., and Tardos, E. (2003), Maximizing the spread of influence through a social network, Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, Washington, DC, USA.
  13. Lee, H.-J. (2013), Breakthrough with SNS marketing for the recession of the advertisement market, The Kyunghyang Newspaper, July 19, Korea.
  14. Lim, S.-S. (2012), The US presidential election campaign using big data with details, Yonhap News, October 22, Korea.
  15. Seidman, S. B. (1983), Network structure and minimum degree, Social Networks, 5, 269-287. https://doi.org/10.1016/0378-8733(83)90028-X