Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem

In social networks, the leave of critical users may significantly break network engagement, i.e., lead a large number of other users to drop out. A popular model to measure social network engagement is k-core, the maximal induced subgraph in which every vertex has at least k neighbors. To identify critical users for social network engagement, we propose the collapsed kcore problem: given a graph G, a positive integer k and a budget b, we aim to find b vertices in G such that the deletion of the b vertices leads to the smallest k-core. We prove the problem is NP-hard. Then, an efficient algorithm is proposed, which significantly reduces the number of candidate vertices to speed up the computation. Our comprehensive experiments on 9 real-life social networks demonstrate the effectiveness and efficiency of our proposed method.

[1]  James Cheng,et al.  Efficient core decomposition in massive networks , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[2]  Kumar Chellapilla,et al.  Finding Dense Subgraphs with Size Bounds , 2009, WAW.

[3]  S. Kanaya,et al.  Prediction of Protein Functions Based on K-Cores of Protein-Protein Interaction Networks and Amino Acid Sequences , 2003 .

[4]  Jeffrey Xu Yu,et al.  A Fast Order-Based Approach for Core Maintenance , 2016, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[5]  Xin Wang,et al.  Recommending Groups to Users Using User-Group Engagement and Time-Dependent Matrix Factorization , 2016, AAAI.

[6]  Srinivasan Parthasarathy,et al.  Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[7]  Wei Cai,et al.  Using the k-core decomposition to analyze the static structure of large-scale software systems , 2010, The Journal of Supercomputing.

[8]  M. Chwe.  Communication and Coordination in Social Networks , 2000 .

[9]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.

[10]  Dimitrios Vogiatzis,et al.  Influence Study on Hyper-Graphs , 2013, AAAI Fall Symposia.

[11]  Evangelos E. Milios,et al.  Characterization of Graphs Using Degree Cores , 2007, WAW.

[12]  Petr A. Golovach,et al.  Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs , 2013, FSTTCS.

[13]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[14]  Tim Roughgarden,et al.  Preventing Unraveling in Social Networks: The Anchored k-Core Problem , 2015, SIAM J. Discret. Math..

[15]  Anthony K. H. Tung,et al.  Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis , 2012, Proc. VLDB Endow..

[16]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[17]  Michalis Vazirgiannis,et al.  To stay or not to stay: modeling engagement dynamics in social graphs , 2013, CIKM.

[18]  Pavlin Mavrodiev,et al.  Social resilience in online communities: the autopsy of friendster , 2013, COSN '13.

[19]  Jeffrey Xu Yu,et al.  I/O efficient Core Graph Decomposition at web scale , 2015, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[20]  Haixun Wang,et al.  Local search of communities in large graphs , 2014, SIGMOD Conference.

[21]  Yannis Stavrakas,et al.  Degeneracy-Based Real-Time Sub-Event Detection in Twitter Stream , 2015, ICWSM.

[22]  Vladimir Batagelj,et al.  An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.

[23]  James Abello,et al.  Fixed points of graph peeling , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[24]  Dimitrios M. Thilikos,et al.  CoreCluster: A Degeneracy Based Graph Clustering Framework , 2014, AAAI.

[25]  Petr A. Golovach,et al.  Preventing Unraveling in Social Networks Gets Harder , 2013, AAAI.

[26]  Abhijin Adiga,et al.  How Robust Is the Core of a Network? , 2013, ECML/PKDD.

[27]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[28]  Lars Backstrom,et al.  Structural diversity in social contagion , 2012, Proceedings of the National Academy of Sciences.

[29]  Silvio Lattanzi,et al.  Arrival and departure dynamics in social networks , 2013, WSDM '13.