Abstract
Many online social networks (OSN), such as Facebook, Twitter can quickly become popular, but many such as Friendster or MySpace can also suffer catastrophic decline in traffics and users. Understanding the capability of OSNs to withstand perturbation and changes, termed social resilience, is a matter of the uttermost importance. In this paper, we investigate the resilience of OSNs under nodes and links removals, where the robustness of the network is measured through the number of triangles, a fundamental property in many networks. Specifically, we strive to discover critical nodes and links whose failures will critically break most triangles in the network, changing the network’s organization and (possibly) leading to the unpredictable dissolving of the network. We formulate this vulnerability analysis as optimization problems, and provide proofs of their intractability. Given the intractability of the problem, we also investigate approximation algorithms and their efficient implementations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Holme, P., Kim, B.J., Yoon, C.N., Han, S.K.: Attack vulnerability of complex networks. Phys. Rev. E 65, 056109 (2002)
Dinh, T.N., Xuan, Y., Thai, M.T., Pardalos, P.M., Znati, T.: On new approaches of assessing network vulnerability: hardness and approximation. IEEE/ACM Trans. Netw. 20(2), 609–619 (2012)
Chan, H., Tong, H., Akoglu, L.: 37. In: Make It or Break It: Manipulating Robustness in Large Networks. SIAM, pp. 325–333 (2014)
Albert, R., Jeong, H., Barabsi, A.L.: Error and attack tolerance of complex networks. Nature 406, 200 (2000)
Allesina, S., Pascual, M.: Googling food webs: Can an eigenvector measure species’ importance for coextinctions? PLoS Comput Biol 5(9), e1000494 (2009)
Grubesic, T.H., Matisziw, T.C., Murray, A.T., Snediker, D.: Comparative approaches for assessing network vulnerability. Inter. Regional Sci. Review 31 (2008)
Murray, A., Matisziw, T., Grubesic, T.: Multimethodological approaches to network vulnerability analysis. Growth Change (2008)
Neumayer, S., Zussman, G., Cohen, R., Modiano, E.: Assessing the vulnerability of the fiber infrastructure to disasters. IEEE/ACM Trans. Netw., 1610–1623 (2011)
Dinh, T.N., Thai, M.T.: Precise structural vulnerability assessment via mathematical programming. In: Proc. of IEEE MILCOM (2011)
Dinh, T., Thai, M.: Network under joint node and link attacks: Vulnerability assessment methods and analysis. IEEE/ACM Transactions on Networking (2015)
Nguyen, N.P., Alim, M.A., Shen, Y., Thai, M.T.: Assessing network vulnerability in a community structure point of view. In: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. ASONAM 2013, pp. 231–235. ACM, New York (2013)
Alim, M.A., Nguyen, N.P., Thang, D.N., Thai, M.T.: Structural vulnerability analysis of overlapping communities in complex networks. In: Proceedings of the 2014 IEEE/WIC/ACM International Conference on Web Intelligence. WI 2014, pp. 231–235. ACM, New York (2014) (to appear)
Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 606–609. Springer, Heidelberg (2005)
Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209–223 (1997)
Li, R., Yu, J.: Triangle minimization in large networks. Knowledge and Information Systems, 1–27 (2014)
Vazirani, V.: Approximation Algorithms. Springer (2001)
Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. Journal of Algorithms 53(1), 55–84 (2004)
Ageev, A., Sviridenko, M.: Pipage rounding: A new method of constructing algorithms with proven performance guarantee. Journal of Combinatorial Optimization 8(3), 307–328 (2004)
Yannakakis, M.: Edge-deletion problems. SIAM Journal on Computing 10(2), 297–309 (1981)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Dinh, T., Tiwari, R. (2015). Breaking Bad: Finding Triangle-Breaking Points in Large Networks. In: Thai, M., Nguyen, N., Shen, H. (eds) Computational Social Networks. CSoNet 2015. Lecture Notes in Computer Science(), vol 9197. Springer, Cham. https://doi.org/10.1007/978-3-319-21786-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-21786-4_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21785-7
Online ISBN: 978-3-319-21786-4
eBook Packages: Computer ScienceComputer Science (R0)