Abstract
Robustness in response to unexpected events is always desirable for real-world networks. To improve the robustness of any networked system, it is important to analyze vulnerability to external perturbation such as random failures or adversarial attacks occurring to elements of the network. In this paper, we study an emerging problem in assessing the robustness of complex networks: the vulnerability of the clustering of the network to the failure of network elements. Specifically, we identify vertices whose failures will critically damage the network by degrading its clustering, evaluated through the average clustering coefficient. This problem is important because any significant change made to the clustering, resulting from element-wise failures, could degrade network performance such as the ability for information to propagate in a social network. We formulate this vulnerability analysis as an optimization problem, prove its NP-completeness and non-monotonicity, and offer two algorithms to identify the vertices most important to clustering. Finally, we conduct comprehensive experiments in synthesized social networks generated by various well-known models as well as traces of real social networks. The empirical results over other competitive strategies show the efficacy of our proposed algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albert R, Jeong H, Barabási AL (2000) Error and attack tolerance of complex networks. Nature 406:200
Albert R, Barabási A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47–97
Alim MA, Kunhle A, Thai MT (2014a) Are communities as strong as we think? In: IEEE ASONAM
Alim MA, Nguyen NP, Dinh TN, Thai MT(2014b) Structural vulnerability analysis of overlapping communities in complex networks. In IEEE/WIC/ACM Web Intelligence, WI ’14, pp 231–235
Allesina S, Pascual M (2009) Googling food webs: can an eigenvector measure species’ importance for coextinctions? PLoS Comput Biol 5(9):e1000494, 09
ArXiv dataset (2003) http://www.cs.cornell.edu/projects/kddcup/datasets.html. KDD Cup 2003
Barclay KJ, Edling C, Rydgren J (2013) Peer clustering of exercise and eating behaviours among young adults in Sweden: a cross-sectional study of egocentric network data. BMC Public Health 13(1):784
Chan H, Tong H, Akoglu L (2014) Make it or break it: manipulating robustness in large networks, chapter 37, pp 325–333. SIAM
Callaway DS, Newman MEJ, Strogatz SH, Watts DJ (2000) Network robustness and fragility: percolation on random graphs. Phys Rev Lett 85:5468–5471
Centola D (2010) The spread of behavior in an online social network experiment. Science 329(5996):1194–1197
Centola D (2011) An experimental study of homophily in the adoption of health behavior. Science 334(6060):1269–1272
Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: ACM SIGKDD, KDD
Chen X (2016) System vulnerability assessment and critical nodes identification. Expert Syst Appl 65:212–220
Criado R, Romance M (2012) Structural vulnerability and robustness in complex networks: different approaches and relationships between them. In: Thai MT, Pardalos PM (eds) Handbook of optimization in complex networks. Optimization and Its Applications. Springer, New York, pp 3–36
Dinh TN, Thai MT (2015a) Toward optimal community detection: from trees to general weighted networks. Internet Math 11(3):181–200
Dinh TN, Thai MT (2015b) Network under joint node and link attacks: vulnerability assessment methods and analysis. IEEE/ACM Trans Netw 23(3):1001–1011
Dinh TN, Nguyen DT, Thai MT (2012) Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? In 23rd ACM Hypertext
Dinh TN, Zhang H, Nguyen DT, Thai MT (2013) Cost-effective viral marketing for time-critical campaigns in large-scale social networks. ACM/IEEE Trans Netw 22(6):2001–2011
Erdős P, Rényi A (1960) On the evolution of random graphs. In Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp 17–61
Ertem Z, Veremyev A, Butenko S (2016) Detecting large cohesive subgroups with high clustering coefficients in social networks. Soc Netw 46:1–10. doi:10.1016/j.socnet.2016.01.001
Fiedler M (1973) Algebraic connectivity of graphs. Czechoslov Math J 23(98):298–305
Frank H, Frisch IT (1970) Analysis and design of survivable networks. IEEE Trans Commun Technol 18(5):501–519
Gall FL (2014) Powers of tensors and fast matrix multiplication. In Proceedings of the 39th international symposium on international symposium on symbolic and algebraic computation, ISSAC ’14, New York, NY, USA. ACM
Garey MR, Johnson DS (1990) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., New York
Gomes T, Esposito C, Hutchison D, Kuipers F, Rak J, Tornatore M (2016) A survey of strategies for communication networks to protect against large-scale natural disasters, vol 2011, pp 11–22
Grubesic TH, Matisziw TC, Murray AT, Snediker D (2008) Comparative approaches for assessing network vulnerability. Int Reg Sci Rev 31(1):88–112
Holme P, Kim BJ, Yoon CN, Han SK (2002) Attack vulnerability of complex networks. Phys Rev E 65:056109
Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: ACM SIGKDD, pp 137
Kuhnle A, Pan T, Alim MA, Thai MT (2017) Scalable bicriteria algorithms for the threshold activation problem in online social networks. In: IEEE international conference on computer communications
Lü L, Chen D-B, Zhou T (2011) The small world yields the most effective information spreading. New J Phys 13(12):123005
Malik N, Mucha PJ (2013) Role of social environment and social clustering in spread of opinions in coevolving networks. Chaos Interdiscip J Nonlinear Sci 23(4):043123
Nguyen DT, Zhang H, Das S, Thai MT, Dinh TN (2013a) Least cost influence in multiplex social networks: model representation and analysis. In IEEE ICDM, pp 567–576. IEEE
Nguyen NP, Xuan Y, Thai MT (2010) A novel method for worm containment on dynamic social networks. In Military Communications Conference, pp 2180–2185
Nguyen NP, Dinh TN, Tokala S, Thai MT(2011) Overlapping communities in dynamic networks: their detection and mobile applications. In ACM MOBICOM, pp 85–96
Nguyen NP, Alim Md A, Shen, Thai MT (2013b) Assessing network vulnerability in a community structure point of view. In IEEE ASONAM, ASONAM ’13, pp 231–235
Peixoto TP, Bornholdt S (2012) Evolution of robust network topologies: emergence of central backbones. Phys Rev Lett 109:118703
Ponton J, Wei P, Sun D (2013) Weighted clustering coefficient maximization for air transportation networks. In: Control Conference (ECC), 2013 European, pp 866–871
Schank T, Wagner D (2005) Finding, counting and listing all triangles in large graphs, an experimental study. In Proceedings of the 4th international conference on experimental and efficient algorithms, WEA’05, pp 606–609
Shen Y, Nguyen NP, Xuan Y, Thai MT (2013) On the discovery of critical links and nodes for assessing network vulnerability. IEEE/ACM Trans Netw 21(3):963–973
Veremyev A, Prokopyev OA, Pasiliao EL (2014) An integer programming framework for critical elements detection in graphs. J Comb Optim 28(1):233–273
Veremyev A, Prokipyev OA, Pasiliao EL (2015) Critical nodes for distance-based connectivity and related problems in graphs. Networks 66(3):170–195
Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in facebook. In: 2nd ACM SIGCOMM Workshop on Social Networks
Watts DJ, Strogatz SH (1998) Collective dynamics of ’small-world’ networks. Nature 393(6684):409–10
Acknowledgements
The work of Alan Kuhnle and My T. Thai is supported in part by NSF EFRI #1441231 and DTRA HDTRA1-14-1-0055. The work of Nam P. Nguyen is supported in part by the NVIDIA Corporation hardware grant and the The Jess and Mildred Fisher Endowed Professor award, Towson University.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kuhnle, A., Nguyen, N.P., Dinh, T.N. et al. Vulnerability of clustering under node failure in complex networks. Soc. Netw. Anal. Min. 7, 8 (2017). https://doi.org/10.1007/s13278-017-0426-5
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-017-0426-5