Chen Chen
Skip Abstract Section
Abstract
The connectivity of networks has been widely studied in many high-impact applications, ranging from immunization, critical infrastructure analysis, social network mining, to bioinformatic system studies. Regardless of the end application domains, connectivity minimization has always been a fundamental task to effectively control the functioning of the underlying system. The combinatorial nature of the connectivity minimization problem imposes an exponential computational complexity to find the optimal solution, which is intractable in large systems. To tackle the computational barrier, greedy algorithm is extensively used to ensure a near-optimal solution by exploiting the diminishing returns property of the problem. Despite the empirical success, the theoretical and algorithmic challenges of the problems still remain wide open. On the theoretical side, the intrinsic hardness and the approximability of the general connectivity minimization problem are still unknown except for a few special cases. On the algorithmic side, existing algorithms are hard to balance between the optimization quality and computational efficiency. In this article, we address the two challenges by (1) proving that the general connectivity minimization problem is NP-hard and \(\) is the best approximation ratio for any polynomial algorithms, and (2) proposing the algorithm CONTAIN and its variant CONTAIN+ that can well balance optimization effectiveness and computational efficiency for eigen-function based connectivity minimization problems in large networks.
- Réka Albert, Hawoong Jeong, and Albert-László Barabási. 1999. Internet: Diameter of the world-wide web. Nature 401, 6749 (1999), 130.Google Scholar
- Réka Albert, Hawoong Jeong, and Albert-László Barabási. 2000. Error and attack tolerance of complex networks. Nature 406, 6794 (2000), 378–382.Google Scholar
- Austin R. Benson, Rediet Abebe, Michael T. Schaub, Ali Jadbabaie, and Jon Kleinberg. 2018. Simplicial closure and higher-order link prediction. Proceedings of the National Academy of Sciences 115, 48 (2018), E11221--E11230.Google ScholarCross Ref
- Béla Bollobás. 2001. The Evolution of Random Graphs–the Giant Component (2 ed.). Cambridge University Press, 130–159. DOI:https://doi.org/10.1017/CBO9780511814068.008Google Scholar
- Deepayan Chakrabarti, Yang Wang, Chenxi Wang, Jurij Leskovec, and Christos Faloutsos. 2008. Epidemic thresholds in real networks. ACM Transactions on Information and System Security 10, 4 (2008), 1. Google ScholarDigital Library
- Hau Chan, Leman Akoglu, and Hanghang Tong. 2014. Make it or break it: Manipulating robustness in large networks. In Proceedings of the 2014 SIAM International Conference on Data Mining. SIAM, 325–333.Google ScholarCross Ref
- Hau Chan, Shuchu Han, and Leman Akoglu. 2015. Where graph topology matters: The robust subgraph problem. In Proceedings of the 2015 SIAM International Conference on Data Mining. SIAM, 10–18.Google ScholarCross Ref
- Chen Chen, Jingrui He, Nadya Bliss, and Hanghang Tong. 2015. On the connectivity of multi-layered networks: Models, measures and optimal control. In Proceedings of the 2015 IEEE International Conference on Data Mining (ICDM ’15). IEEE, 715–720. Google ScholarDigital Library
- Chen Chen, Ruiyue Peng, Lei Ying, and Hanghang Tong. 2018. Network connectivity optimization: Fundamental limits and effective algorithms. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM, 1167–1176. Google ScholarDigital Library
- Chen Chen and Hanghang Tong. 2017. On the eigen-functions of dynamic graphs: Fast tracking and attribution algorithms. Statistical Analysis and Data Mining: The ASA Data Science Journal 10, 2 (2017), 121–135.Google ScholarCross Ref
- Chen Chen, Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad, Michalis Faloutsos, and Christos Faloutsos. 2016. Eigen-optimization on large graphs by edge manipulation. ACM Transactions on Knowledge Discovery from Data 10, 4 (June 2016), 30 pages. DOI:https://doi.org/10.1145/2903148 Google ScholarDigital Library
- Chen Chen, Hanghang Tong, B. Aditya Prakash, Charalampos E. Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, and Duen Horng Chau. 2016. Node immunization on large graphs: Theory and algorithms. IEEE Transactions on Knowledge and Data Engineering 28, 1 (2016), 113–126. Google ScholarDigital Library
- Liangzhe Chen, Xinfeng Xu, Sangkeun Lee, Sisi Duan, Alfonso G. Tarditi, Supriya Chinthavali, and B. Aditya Prakash. 2017. Hotspots: Failure cascades on heterogeneous critical infrastructure networks. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. ACM, 1599–1607. Google ScholarDigital Library
- Wei Chen, Chi Wang, and Yajun Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 1029–1038. Google ScholarDigital Library
- Wei Chen, Yajun Wang, and Siyu Yang. 2009. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 199–208. Google ScholarDigital Library
- Xilun Chen and K. Selcuk Candan. 2014. LWI-SVD: Low-rank, windowed, incremental singular value decompositions on time-evolving data sets. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 987–996. Google ScholarDigital Library
- Reuven Cohen, Shlomo Havlin, and Daniel Ben-Avraham. 2003. Efficient immunization strategies for computer networks and populations. Physical Review Letters 91, 24 (2003), 247901.Google ScholarCross Ref
- Allan Peter Davis, Cynthia J. Grondin, Kelley Lennon-Hopkins, Cynthia Saraceni-Richards, Daniela Sciaky, Benjamin L. King, Thomas C. Wiegers, and Carolyn J. Mattingly. 2015. The comparative toxicogenomics database’s 10th year anniversary: Update 2015. Nucleic Acids Research 43, D1 (2015), D914–D920.Google ScholarCross Ref
- Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Pardalos, and Taieb Znati. 2011. On new approaches of assessing network vulnerability: Hardness and approximation. IEEE/ACM Transactions on Networking 20, 2 (2011), 609–619. Google ScholarDigital Library
- Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. 1999. On power-law relationships of the internet topology. ACM SIGCOMM Computer Communication Review 29, 4 (1999), 251–262. Google ScholarDigital Library
- Linton C. Freeman. 1978. Centrality in social networks conceptual clarification. Social Networks 1, 3 (1978), 215–239.Google ScholarCross Ref
- Mark Jerrum and Alistair Sinclair. 1988. Conductance and the rapid mixing property for Markov chains: The approximation of permanent resolved. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing. ACM, 235–244. Google ScholarDigital Library
- Ling Jian, Jundong Li, and Huan Liu. 2018. Toward online node classification on streaming networks. Data Mining and Knowledge Discovery 32, 1 (2018), 231–257. DOI:https://doi.org/10.1007/s10618-017-0533-y Google ScholarDigital Library
- W.U. Jun, Mauricio Barahona, Tan Yue-Jin, and Deng Hong-Zhong. 2010. Natural connectivity of complex networks. Chinese Physics Letters 27, 7 (2010), 078902.Google ScholarCross Ref
- David Kempe, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 137–146. Google ScholarDigital Library
- Samir Khuller, Anna Moss, and Joseph Seffi Naor. 1999. The budgeted maximum coverage problem. Information Processing Letters 70, 1 (1999), 39–45. Google ScholarDigital Library
- Jon Kleinberg and Eva Tardos. 2006. Algorithm Design. Pearson Education India. Google ScholarDigital Library
- Michael A. Kohanski, Daniel J. Dwyer, and James J. Collins. 2010. How antibiotics kill bacteria: From targets to networks. Nature Reviews Microbiology 8, 6 (2010), 423.Google ScholarCross Ref
- Istvan A. Kovacs and Albert-Laszlo Barabasi. 2015. Network science: Destruction perfected. Nature 524, 7563 (2015), 38–39.Google Scholar
- Long T. Le, Tina Eliassi-Rad, and Hanghang Tong. 2015. MET: A fast algorithm for minimizing propagation in large graphs with small eigen-gaps. In Proceedings of the 2015 SIAM International Conference on Data Mining. SIAM, 694–702.Google ScholarCross Ref
- Jure Leskovec, Lada A. Adamic, and Bernardo A. Huberman. 2007. The dynamics of viral marketing. ACM Transactions on the Web 1, 1 (2007), 5. Google ScholarDigital Library
- Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. 2005. Graphs over time: Densification laws, shrinking diameters and possible explanations. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. ACM, 177–187. Google ScholarDigital Library
- Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data 1, 1 (2007), 2. Google ScholarDigital Library
- Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. 2007. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 420–429. Google ScholarDigital Library
- Jundong Li, Harsh Dani, Xia Hu, Jiliang Tang, Yi Chang, and Huan Liu. 2017. Attributed network embedding for learning in a dynamic environment. In Proceedings of the CIKM 2017. ACM, 387–396. Google ScholarDigital Library
- Liangyue Li, Hanghang Tong, Yanghua Xiao, and Wei Fan. 2015. Cheetah: Fast graph kernel tracking on dynamic graphs. In Proceedings of the 2015 SIAM International Conference on Data Mining. SIAM, 280–288.Google ScholarCross Ref
- Rong-Hua Li and Jeffrey Xu Yu. 2015. Triangle minimization in large networks. Knowledge and Information Systems 45, 3 (2015), 617–643. Google ScholarDigital Library
- Qiao Liu, Chen Chen, Annie Gao, Hang Hang Tong, and Lei Xie. 2017. VariFunNet, an integrated multiscale modeling framework to study the effects of rare non-coding variants in genome-wide association studies: Applied to Alzheimer’s disease. In Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM ’17). 2177–2182.Google ScholarCross Ref
- Julian Mcauley and Jure Leskovec. 2014. Discovering social circles in ego networks. ACM Transactions on Knowledge Discovery from Data 8, 1 (2014), 4. Google ScholarDigital Library
- Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: Simple building blocks of complex networks. Science 298, 5594 (2002), 824–827.Google Scholar
- Flaviano Morone and Hernán A. Makse. 2015. Influence maximization in complex networks through optimal percolation. Nature 524, 7563 (2015), 65.Google Scholar
- George L. Nemhauser, Laurence A. Wolsey, and Marshall L. Fisher. 1978. An analysis of approximations for maximizing submodular set functions–I. Mathematical Programming 14, 1 (1978), 265–294. Google ScholarDigital Library
- Mark E. J. Newman. 2008. The mathematics of networks. The New Palgrave Encyclopedia of Economics 2, 2008 (2008), 1–12.Google Scholar
- Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report.Google Scholar
- B. Aditya Prakash, Deepayan Chakrabarti, Nicholas C. Valler, Michalis Faloutsos, and Christos Faloutsos. 2012. Threshold conditions for arbitrary cascade models on arbitrary networks. Knowledge and Information Systems 33, 3 (2012), 549–575. Google ScholarDigital Library
- Yilin Shen, Nam P. Nguyen, Ying Xuan, and My T. Thai. 2012. On the discovery of critical links and nodes for assessing network vulnerability. IEEE/ACM Transactions on Networking 21, 3 (2012), 963–973. Google ScholarDigital Library
- Michael Sipser. 1997. Introduction to the Theory of Computation. PWS Publishing Company. Google ScholarDigital Library
- Daniel Spielman. 2012. Spectral graph theory. In Combinatorial Scientific Computing. Number 18. Citeseer.Google Scholar
- Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zhang, and Zhong Su. 2008. Arnetminer: Extraction and mining of academic social networks. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 990–998. Google ScholarDigital Library
- Lei Tang and Huan Liu. 2009. Relational learning via latent social dimensions. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 817–826. Google ScholarDigital Library
- Charalampos E. Tsourakakis. 2008. Fast counting of triangles in large real networks without counting: Algorithms and laws. In Proceedings of the 2008 8th IEEE International Conference on Data Mining. IEEE, 608–617. Google ScholarDigital Library
- Stanley Wasserman and Katherine Faust. 1994. Social Network Analysis: Methods and Applications. Vol. 8. Cambridge University Press.Google Scholar
- Hao Yin, Austin R. Benson, and Jure Leskovec. 2019. The local closure coefficient: A new perspective on network clustering. Networks 26, 41 (2019), 44.Google Scholar
- Hao Yin, Austin R. Benson, Jure Leskovec, and David F. Gleich. 2017. Local higher-order graph clustering. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 555–564. DOI:https://doi.org/10.1145/3097983.3098069 Google ScholarDigital Library
Index Terms
- Fast Connectivity Minimization on Large-Scale Networks
Recommendations
Network Connectivity Optimization: Fundamental Limits and Effective Algorithms
KDD '18: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data MiningNetwork connectivity optimization, which aims to manipulate network connectivity by changing its underlying topology, is a fundamental task behind a wealth of high-impact data mining applications, ranging from immunization, critical infrastructure ...
Connectivity in Complex Networks: Measures, Inference and Optimization
WSDM '18: Proceedings of the Eleventh ACM International Conference on Web Search and Data MiningNetworks are ubiquitous in many high impact domains. Among the various aspects of network studies, connectivity is the one that plays important role in many applications (e.g., information dissemination, robustness analysis, community detection, etc.). ...
Fast L1---L2 Minimization via a Proximal Operator
This paper aims to develop new and fast algorithms for recovering a sparse vector from a small number of measurements, which is a fundamental problem in the field of compressive sensing (CS). Currently, CS favors incoherent systems, in which any two ...
Comments