On Detection of Community Structure in Dynamic Social Networks

Community structure is a very special and interesting property of social networks. Knowledge of network community structure not only provides us key insights into developing more social-aware strategies for social network problems, but also promises a wide range of applications enabled by mobile networking, such as routings in Mobile Ad Hoc Networks (MANETs) and worm containments in cellular networks. Unfortunately, understanding this structure is very challenging, especially in dynamic social networks where social activities and interactions tend to come and go rapidly. Can we quickly and efficiently identify the network community structure? Can we adaptively update this structure based on its history instead of recomputing from scratch?In this chapter, we present two methods for detecting community structures on social networks. First, we introduce Quick Community Adaptation (QCA), an adaptive modularity-based method for identifying and tracing the discrete community structure of dynamic social networks. This approach has not only the power of quickly and efficiently updating the network structure by only using the identified structures, but also the ability of tracing the evolution of its communities over time. Next, we present DOCA, an quick method for revealing the overlapping network communities that can be implemented in a decentralized manner. To illustrate the effectiveness of our methods, we extensively test QCA and DOCA on not only synthesized but also on real-world dynamic social networks including ENRON email network, arXiv e-print citation network and Facebook network. Finally, we demonstrate the bright applicability of our methods via two realistic applications on routing strategies in MANETs and worm containment on online social networks.

[1]  Ying Xuan,et al.  Towards social-aware routing in dynamic communication networks , 2009, 2009 IEEE 28th International Performance Computing and Communications Conference.

[2]  Jianyong Wang,et al.  Parallel community detection on large networks with propinquity dynamics , 2009, KDD.

[3]  Kang G. Shin,et al.  Behavioral detection of malware on mobile handsets , 2008, MobiSys '08.

[4]  Philip S. Yu,et al.  GraphScope: parameter-free mining of large time-evolving graphs , 2007, KDD '07.

[5]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Ravi Kumar,et al.  On the Bursty Evolution of Blogspace , 2003, WWW '03.

[7]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[8]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[9]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[10]  Albert-László Barabási,et al.  Understanding the Spreading Patterns of Mobile Phone Viruses , 2009, Science.

[11]  V. Carchiolo,et al.  Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.

[12]  Leto Peel,et al.  Estimating network parameters for selecting community detection algorithms , 2010, 2010 13th International Conference on Information Fusion.

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

[14]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[15]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[16]  Pan Hui,et al.  Distributed community detection in delay tolerant networks , 2007, MobiArch '07.

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

[18]  James Newsome,et al.  Polygraph: automatically generating signatures for polymorphic worms , 2005, 2005 IEEE Symposium on Security and Privacy (S&P'05).

[19]  Sencun Zhu,et al.  A Social Network Based Patching Scheme for Worm Containment in Cellular Networks , 2009, IEEE INFOCOM 2009.

[20]  N. Meyers,et al.  H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[21]  Masaru Kitsuregawa,et al.  Extracting evolution of web communities from a series of web archives , 2003, HYPERTEXT '03.

[22]  Yun Chi,et al.  Analyzing communities and their evolutions in dynamic social networks , 2009, TKDD.

[23]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

[24]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[25]  Steve Gregory,et al.  An Algorithm to Find Overlapping Community Structure in Networks , 2007, PKDD.

[26]  Fergal Reid,et al.  Detecting highly overlapping community structure by greedy clique expansion , 2010, KDD 2010.

[27]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[28]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[29]  Tam'as Vicsek,et al.  Modularity measure of networks with overlapping communities , 2009, 0910.5072.

[30]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

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

[32]  Bart Selman,et al.  Tracking evolving communities in large linked networks , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[33]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[34]  A. Barabasi,et al.  Social group dynamics in networks , 2009 .

[35]  Jun Yu,et al.  Adaptive clustering algorithm for community detection in complex networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Vern Paxson,et al.  Proceedings of the 13th USENIX Security Symposium , 2022 .

[37]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[38]  Tanya Y. Berger-Wolf,et al.  Constant-factor approximation algorithms for identifying dynamic communities , 2009, KDD.

[39]  Kang G. Shin,et al.  Proactive security for mobile messaging networks , 2006, WiSe '06.

[40]  Huawei Shen,et al.  Quantifying and identifying the overlapping community structure in networks , 2009, 0905.2666.

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

[42]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[43]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2007, PerCom Workshops.

[44]  Claudio Castellano,et al.  Community Structure in Graphs , 2007, Encyclopedia of Complexity and Systems Science.

[45]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[46]  R. Lambiotte,et al.  Line graphs, link partitions, and overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[47]  Ram Dantu,et al.  Fast Worm Containment Using Feedback Control , 2007, IEEE Transactions on Dependable and Secure Computing.

[48]  Vyas Sekar,et al.  A Multi-Resolution Approach forWorm Detection and Containment , 2006, International Conference on Dependable Systems and Networks (DSN'06).

[49]  B. Karp,et al.  Autograph: Toward Automated, Distributed Worm Signature Detection , 2004, USENIX Security Symposium.

[50]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.