Group disappearance in social networks with communities

The purpose of this paper is to handle the disappearance of a group of nodes in a social network. The quality of the information flow is used as a key performance indicator to conduct network changes after group disappearance. Nodes as well as node sets are first classified into categories (critical and non-critical nodes, and scattered, contiguous and hybrid groups) and then analyzed according to two distinct perspectives: the network as a whole or its identified communities. Finally, algorithms are devised to manage group disappearance according to different cases. New links are added in a parsimonious way and a possible substitute for a leaving group is found based on the adage “birds of a feather flock together” and the homophily principle. This means that new links (e.g., relationships) and a potential substitute are found only between individuals that share common characteristics such as beliefs, values, and education, i.e., individuals that are more likely neighbors of the leaving node or group. To validate our approach, an empirical study is conducted using various kinds of data sets and a set of criteria. The results show the benefits of our solution in terms of response time, number of added links and metrics of the overall network topology.

[1]  Stephen P. Borgatti,et al.  Models and Methods in Social Network Analysis: Extending Centrality , 2005 .

[2]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[3]  Bradley S. Rees,et al.  Overlapping community detection using a community optimized graph swarm , 2012, Social Network Analysis and Mining.

[4]  Rokia Missaoui,et al.  Network restructuring after a node removal , 2011 .

[5]  Faraz Zaidi,et al.  Communities and hierarchical structures in dynamic social networks: analysis and visualization , 2011, Social Network Analysis and Mining.

[6]  P. Killworth,et al.  Informant accuracy in social network data III: A comparison of triadic structure in behavioral and cognitive data , 1979 .

[7]  Rokia Missaoui,et al.  Social network restructuring after a node removal , 2013, Int. J. Web Eng. Technol..

[8]  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.

[9]  Uffe Kock Wiil,et al.  Node Removal in Criminal Networks , 2011, 2011 European Intelligence and Security Informatics Conference.

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

[11]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[12]  Madhav V. Marathe,et al.  Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks , 2010, ECML/PKDD.

[13]  Rokia Missaoui,et al.  Predicting a Social Network Structure Once a Node Is Deleted , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[14]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[15]  Dil Muhammad Akbar Hussain,et al.  Dynamical Adaptation in Terrorist Cells/Networks , 2008, SCSS.

[16]  Rokia Missaoui,et al.  Managing node disappearance based on information flow in social networks , 2013, Social Network Analysis and Mining.

[17]  D. Knoke,et al.  Social Network Analysis: Second Edition , 2008 .

[18]  Narsingh Deo,et al.  Efficient community identification in complex networks , 2012, Social Network Analysis and Mining.

[19]  S. Wasserman,et al.  Models and methods in social network analysis , 2005 .

[20]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[21]  Cun-Quan Zhang,et al.  Terrorist Networks, Network Energy and Node Removal: A New Measure of Centrality Based on Laplacian Energy , 2013 .

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

[23]  C. F. Hossain,et al.  INVESTIGATION OF ANTIMICROBIAL AND ANTI-INFLAMMATORY ACTIVITY OF CURCUMA LONGA , 2013 .

[24]  Shou-De Lin,et al.  Finding influential seed successors in social networks , 2012, WWW.

[25]  Daniel Ortiz Arroyo,et al.  Discovering Sets of Key Players in Social Networks , 2010, Computational Social Network Analysis.

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

[27]  Rokia Missaoui,et al.  Dealing with Disappearance of an Actor Set in Social Networks , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[28]  S. Wasserman,et al.  Models and Methods in Social Network Analysis: Structural Analysis in the Social Sciences , 2005 .

[29]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[30]  Charu C. Aggarwal,et al.  On Flow Authority Discovery in Social Networks , 2011, SDM.