Discovering Top-k Structural Hole Spanners in Dynamic Networks

Structural Hole (SH) theory states that the node which acts as a connecting link among otherwise disconnected communities gets positional advantages in the network. These nodes are called Structural Hole Spanners (SHS). Numerous solutions are proposed to discover SHSs; however, most of the solutions are only applicable to static networks. Since real-world networks are dynamic networks; consequently, in this study, we aim to discover SHSs in dynamic networks. Discovering SHSs is an NP-hard problem, due to which, instead of discovering exact k SHSs, we adopt a greedy approach to discover Top-k SHSs. We first propose an efficient Tracking-SHS algorithm for updating SHSs in dynamic networks. Our algorithm reuses the information obtained during the initial runs of the static algorithm and avoids the recomputations for the nodes unaffected by the updates. Besides, motivated from the success of Graph Neural Networks (GNNs) on various graph mining problems, we also design a Graph Neural Network-based model, GNN-SHS, to discover SHSs in dynamic networks, aiming to reduce the computational cost while achieving high accuracy. We provide a theoretical analysis of the Tracking-SHS algorithm, and our theoretical results prove that for a particular type of graphs, such as Preferential Attachment graphs [1], Tracking-SHS algorithm achieves 1.6 times of speedup compared with the static algorithm. We perform extensive experiments, and our results demonstrate that the Tracking-SHS algorithm attains a minimum of 3.24 times speedup over the static algorithm. Also, the proposed second model GNN-SHS is on an average 671.6 times faster than the Tracking-SHS algorithm.

[1]  Zhiwu Li,et al.  Modeling and analysis of rumor propagation in social networks , 2021, Inf. Sci..

[2]  Mehdi Ghatee,et al.  Distance-aware optimization model for influential nodes identification in social networks with independent cascade diffusion , 2021, Inf. Sci..

[3]  Javier Rubio-Loyola,et al.  A novel evaluation function for higher acceptance rates and more profitable metaheuristic-based online virtual network embedding , 2021, Comput. Networks.

[4]  M. Babar,et al.  A Review on C3I Systems’ Security: Vulnerabilities, Attacks, and Countermeasures , 2021, ACM Comput. Surv..

[5]  Naixue Xiong,et al.  ITCN: An Intelligent Trust Collaboration Network System in IoT , 2021, IEEE Transactions on Network Science and Engineering.

[6]  Yung-Ming Li,et al.  An efficient approach to identify social disseminators for timely information diffusion , 2021, Inf. Sci..

[7]  Xingwang Zhao,et al.  A community detection algorithm based on graph compression for large-scale social networks , 2020, Inf. Sci..

[8]  Xiaochun Cao,et al.  Toward Unsupervised Graph Neural Network: Interactive Clustering and Embedding via Optimal Transport , 2020, 2020 IEEE International Conference on Data Mining (ICDM).

[9]  Yajun Du,et al.  Detecting community structure and structural hole spanner simultaneously by using graph convolutional network based Auto-Encoder , 2020, Neurocomputing.

[10]  Xiaoying Li,et al.  Structural hole-based approach to control public opinion in a social network , 2020, Eng. Appl. Artif. Intell..

[11]  Rui Ma,et al.  Finding structural hole spanners based on community forest model and diminishing marginal utility in large scale social networks , 2020, Knowl. Based Syst..

[12]  Weifa Liang,et al.  Identifying structural hole spanners to maximally block information propagation , 2019, Inf. Sci..

[13]  Xin Wang,et al.  Identifying Structural Hole Spanners in Online Social Networks Using Machine Learning , 2019, SIGCOMM Posters and Demos.

[14]  Ambuj K. Singh,et al.  Fighting Opinion Control in Social Networks via Link Recommendation , 2019, KDD.

[15]  Andreas Loukas,et al.  What graph neural networks cannot learn: depth vs width , 2019, ICLR.

[16]  Mahdi Jalili,et al.  Influential node ranking in social networks based on neighborhood diversity , 2019, Future Gener. Comput. Syst..

[17]  Gianluca Stringhini,et al.  Screenshot Classifier annotated images pHashes of non-screenshot annotated images Know Your Meme Generic Annotation Sites Meme Annotation Sites Generic Web Communities , 2018 .

[18]  Xiao-Ming Wu,et al.  Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning , 2018, AAAI.

[19]  Jian Pei,et al.  A Survey on Network Embedding , 2017, IEEE Transactions on Knowledge and Data Engineering.

[20]  Pietro Liò,et al.  Graph Attention Networks , 2017, ICLR.

[21]  Weifa Liang,et al.  Efficient Algorithms for the Identification of Top-$k$ Structural Hole Spanners in Large Social Networks , 2017, IEEE Transactions on Knowledge and Data Engineering.

[22]  Max Welling,et al.  Semi-Supervised Classification with Graph Convolutional Networks , 2016, ICLR.

[23]  Philip S. Yu,et al.  Joint Community and Structural Hole Spanner Detection via Harmonic Modularity , 2016, KDD.

[24]  Weifa Liang,et al.  Identifying Top-k Structural Hole Spanners in Large-Scale Social Networks , 2015, CIKM.

[25]  Jie Tang,et al.  Mining structural hole spanners through information diffusion in social networks , 2013, WWW.

[26]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[27]  Panos M. Pardalos,et al.  On New Approaches of Assessing Network Vulnerability: Hardness and Approximation , 2012, IEEE/ACM Transactions on Networking.

[28]  Jie Tang,et al.  Inferring social ties across heterogenous networks , 2012, WSDM '12.

[29]  Sanjeev Goyal,et al.  Structural holes in social networks , 2007, J. Econ. Theory.

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

[31]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[32]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

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

[34]  Thed N. van Leeuwen,et al.  Citation delay in interdisciplinary knowledge exchange , 2001, Scientometrics.

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

[36]  Steven B. Andrews,et al.  Structural Holes: The Social Structure of Competition , 1995, The SAGE Encyclopedia of Research Design.

[37]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[38]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

[39]  Philip S. Yu,et al.  A Comprehensive Survey on Graph Neural Networks , 2019, IEEE Transactions on Neural Networks and Learning Systems.

[40]  Jun Wang,et al.  Method for Detecting Key Nodes who Occupy Structural Holes in Social Network sites , 2016, PACIS.