Connectivity in Complex Networks: Measures, Inference and Optimization

Networks 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.). The diversified applications have spurred numerous connectivity measures. Accordingly, ad-hoc connectivity optimization methods are designed for each measure, making it hard to model and control the connectivity of the network in a uniformed framework. On the other hand, it is often impossible to maintain an accurate structure of the network due to network dynamics and noise in real applications, which would affect the accuracy of connectivity measures and the effectiveness of corresponding connectivity optimization methods. In this work, we aim to address the challenges on network connectivity by (1)unifying a wide range of classic network connectivity measures into one uniform model; (2)proposing effective approaches to infer connectivity measures and network structures from dynamic and incomplete input data, and (3) providing a general framework to optimize the connectivity measures in the network.

[1]  Jingrui He,et al.  Towards Optimal Connectivity on Multi-Layered Networks , 2017, IEEE Transactions on Knowledge and Data Engineering.

[2]  Zhongqi Lu,et al.  Selective Transfer Learning for Cross Domain Recommendation , 2012, SDM.

[3]  Hanghang Tong,et al.  Fast Eigen-Functions Tracking on Dynamic Graphs , 2015, SDM.

[4]  Lei Xie,et al.  FASCINATE: Fast Cross-Layer Dependency Inference on Multi-layered Networks , 2016, KDD.

[5]  Wei Chen,et al.  Making recommendations from multiple domains , 2013, KDD.

[6]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[7]  F. Harary,et al.  The spectral approach to determining the number of walks in a graph , 1979 .

[8]  Jingrui He,et al.  On the Connectivity of Multi-layered Networks: Models, Measures and Optimal Control , 2015, 2015 IEEE International Conference on Data Mining.

[9]  Michael Y. Galperin,et al.  The 2015 Nucleic Acids Research Database Issue and Molecular Biology Database Collection , 2014, Nucleic Acids Res..

[10]  Jie Tang,et al.  ArnetMiner: extraction and mining of academic social networks , 2008, KDD.

[11]  Christos Faloutsos,et al.  Epidemic thresholds in real networks , 2008, TSEC.

[12]  Hanghang Tong,et al.  Make It or Break It: Manipulating Robustness in Large Networks , 2014, SDM.

[13]  Jingrui He,et al.  A Graph-based Recommendation across Heterogeneous Domains , 2015, CIKM.

[14]  Charalampos E. Tsourakakis.  Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[15]  Wu Jun,et al.  Natural Connectivity of Complex Networks , 2010 .

[16]  M. Newman.  Mathematics of networks , 2018, Oxford Scholarship Online.

[17]  S. Havlin,et al.  Interdependent networks: reducing the coupling strength leads to a change from a first to second order percolation transition. , 2010, Physical review letters.

[18]  Arunabha Sen,et al.  Identification of K most vulnerable nodes in multi-layered network using a new model of interdependency , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[19]  Hanghang Tong,et al.  On the eigen‐functions of dynamic graphs: Fast tracking and attribution algorithms , 2017, Stat. Anal. Data Min..

[20]  Qiang Yang,et al.  Can Movies and Books Collaborate? Cross-Domain Collaborative Filtering for Sparsity Reduction , 2009, IJCAI.

[21]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[22]  H. Stanley,et al.  Networks formed from interdependent networks , 2011, Nature Physics.

[23]  Christos Faloutsos,et al.  Node Immunization on Large Graphs: Theory and Algorithms , 2016, IEEE Transactions on Knowledge and Data Engineering.