Social Network Analysis in Streaming Call Graphs

Mobile phones are powerful tools to connect people. The streams of Call Detail Records (CDR’s) generating from these devices provide a powerful abstraction of social interactions between individuals, representing social structures. Call graphs can be deduced from these CDRs, where nodes represent subscribers and edges represent the phone calls made. These graphs may easily reach millions of nodes and billions of edges. Besides being large-scale and generated in real-time, the underlying social networks are inherently complex and, thus, difficult to analyze. Conventional data analysis performed by telecom operators is slow, done by request and implies heavy costs in data warehouses. In face of these challenges, real-time streaming analysis becomes an ever increasing need to mobile operators, since it enables them to quickly detect important network events and optimize business operations. Sampling, together with visualization techniques, are required for online exploratory data analysis and event detection in such networks. In this chapter, we report the burgeoning body of research in network sampling, visualization of streaming social networks, stream analysis and the solutions proposed so far.

[1]  Boleslaw K. Szymanski,et al.  LabelRankT: incremental community detection in dynamic networks via label propagation , 2013, DyNetMM '13.

[2]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[3]  Kathleen M. Carley,et al.  Incremental closeness centrality for dynamically changing social networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[4]  Markus Prossegger,et al.  Incremental Spectral Clustering , 2012 .

[5]  João Gama,et al.  Streaming Networks Sampling using top-K Networks , 2015, ICEIS.

[6]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[7]  R. Hanneman.  Introduction to Social Network Methods , 2001 .

[8]  Rajeev Motwani,et al.  Approximate Frequency Counts over Data Streams , 2012, VLDB.

[9]  Boleslaw K. Szymanski,et al.  Towards Linear Time Overlapping Community Detection in Social Networks , 2012, PAKDD.

[10]  Graham Cormode,et al.  What's hot and what's not: tracking most frequent items dynamically , 2003, TODS.

[11]  David A. Bader,et al.  A Fast Algorithm for Streaming Betweenness Centrality , 2012, 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing.

[12]  Divyakant Agrawal,et al.  Efficient Computation of Frequent and Top-k Elements in Data Streams , 2005, ICDT.

[13]  Francesco Bonchi,et al.  Scalable Online Betweenness Centrality in Evolving Graphs , 2014, IEEE Transactions on Knowledge and Data Engineering.

[14]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[15]  Moses Charikar,et al.  Finding frequent items in data streams , 2004, Theor. Comput. Sci..

[16]  Ramana Rao Kompella,et al.  Space-efficient sampling from social activity streams , 2012, BigMine '12.

[17]  Dusit Niyato,et al.  Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey , 2011, Proceedings of the IEEE.

[18]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..

[19]  Cheng Wu,et al.  A Real-Time Detecting Algorithm for Tracking Community Structure of Dynamic Networks , 2014, ArXiv.

[20]  Kathleen M. Carley,et al.  Incremental algorithm for updating betweenness centrality in dynamically growing networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[21]  Christos Faloutsos,et al.  Sampling from large graphs , 2006, KDD '06.

[22]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[23]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[24]  Ryan H. Choi,et al.  QUBE: a quick algorithm for updating betweenness centrality , 2012, WWW.

[25]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[26]  Nick Koudas,et al.  Sampling Online Social Networks , 2013, IEEE Transactions on Knowledge and Data Engineering.

[27]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Hans-Peter Kriegel,et al.  Metropolis Algorithms for Representative Subgraph Sampling , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[29]  Mark S. Granovetter.  Network Sampling: Some First Steps , 1976, American Journal of Sociology.

[30]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Ross J. Anderson,et al.  Temporal node centrality in complex networks. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  Boleslaw K. Szymanski,et al.  Community detection using a neighborhood strength driven Label Propagation Algorithm , 2011, 2011 IEEE Network Science Workshop.

[33]  Albert-László Barabási,et al.  The origin of bursts and heavy tails in human dynamics , 2005, Nature.

[34]  Nam P. Nguyen,et al.  Adaptive algorithms for detecting community structure in dynamic social networks , 2011, 2011 Proceedings IEEE INFOCOM.

[35]  Sushant S. Khopkar,et al.  Efficient algorithms for incremental all pairs shortest paths, closeness and betweenness in social network analysis , 2014, Social Network Analysis and Mining.

[36]  Erik D. Demaine,et al.  Frequency Estimation of Internet Packet Streams with Limited Space , 2002, ESA.

[37]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[38]  Alexandre Proutière,et al.  Streaming, Memory Limited Algorithms for Community Detection , 2014, NIPS.

[39]  Sanjukta Bhowmick,et al.  Fast Community Detection for Dynamic Complex Networks , 2011, CompleNet.