Network Reconstruction and Controlling Based on Structural Regularity Analysis

From the perspective of network analysis, the ubiquitous networks are comprised of regular and irregular components, which makes uncovering the complexity of network structures to be a fundamental challenge. Exploring the regular information and identifying the roles of microscopic elements in network data can help us recognize the principle of network organization and contribute to network data utilization. However, the intrinsic structural properties of networks remain so far inadequately explored and theorised. With the realistic assumption that there are consistent features across the local structures of networks, we propose a low-rank pursuit based self-representation network model, in which the principle of network organization can be uncovered by a representation matrix. According to this model, original true networks can be reconstructed based on the observed unreliable network topology. In particular, the proposed model enables us to estimate the extent to which the networks are regulable, i.e., measuring the reconstructability of networks. In addition, the model is capable of measuring the importance of microscopic network elements, i.e., nodes and links, in terms of network regularity thereby allowing us to regulate the reconstructability of networks based on them. Extensive experiments on disparate real-world networks demonstrate the effectiveness of the proposed network reconstruction and regulation algorithm. Specifically, the network regularity metric can reflect the reconstructability of networks, and the reconstruction accuracy can be improved by removing irregular network links. Lastly, our approach provides an unique and novel insight into the organization exploring of complex networks.

[1]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[2]  Linyuan Lü,et al.  Predicting missing links via local information , 2009, 0901.0553.

[3]  Mark E. J. Newman,et al.  Network structure from rich but noisy data , 2017, Nature Physics.

[4]  Yong Yu,et al.  Robust Subspace Segmentation by Low-Rank Representation , 2010, ICML.

[5]  T. Zhou,et al.  Effective and Efficient Similarity Index for Link Prediction of Complex Networks , 2009, 0905.3558.

[6]  Luciano da Fontoura Costa,et al.  Predicting the connectivity of primate cortical networks from topological and spatial node properties , 2007, BMC Systems Biology.

[7]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[8]  Hui Xiong,et al.  Enhancing data analysis with noise removal , 2006, IEEE Transactions on Knowledge and Data Engineering.

[9]  G. Sapiro,et al.  A collaborative framework for 3D alignment and classification of heterogeneous subvolumes in cryo-electron tomography. , 2013, Journal of structural biology.

[10]  Yi Ma,et al.  The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices , 2010, Journal of structural biology.

[11]  Christos Faloutsos,et al.  Detecting suspicious following behavior in multimillion-node social networks , 2014, WWW.

[12]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[13]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[14]  Ivor W. Tsang,et al.  Incremental Subgraph Feature Selection for Graph Classification , 2017, IEEE Transactions on Knowledge and Data Engineering.

[15]  Albert-László Barabási,et al.  Scale-Free Networks: A Decade and Beyond , 2009, Science.

[16]  Charles Elkan,et al.  Link Prediction via Matrix Factorization , 2011, ECML/PKDD.

[17]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[18]  Carey E. Priebe,et al.  Graph Classification Using Signal-Subgraphs: Applications in Statistical Connectomics , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[20]  Mark E. J. Newman,et al.  Network reconstruction and error estimation with noisy network data , 2018, ArXiv.

[21]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[22]  Tao Wu,et al.  Power iteration ranking via hybrid diffusion for vital nodes identification , 2018, Physica A: Statistical Mechanics and its Applications.

[23]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  David A. Smith,et al.  Structure and Dynamics of the Global Economy: Network Analysis of International Trade 1965–1980 , 1992 .

[25]  Ming Tang,et al.  Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics , 2015, Scientific Reports.

[26]  Jure Leskovec,et al.  The Network Completion Problem: Inferring Missing Nodes and Edges in Networks , 2011, SDM.

[27]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[28]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[29]  Xin Lu,et al.  Efficient network disintegration under incomplete information: the comic effect of link prediction , 2016, Scientific reports.

[30]  J. Leskovec,et al.  Network Enhancement: a general method to denoise weighted biological networks , 2018, bioRxiv.

[31]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[32]  Ryan A. Rossi,et al.  Efficient Graphlet Counting for Large Networks , 2015, 2015 IEEE International Conference on Data Mining.

[33]  Ye Yuan,et al.  Link prediction via linear optimization , 2018, Physica A: Statistical Mechanics and its Applications.

[34]  M. E. J. Newman,et al.  Network structure from rich but noisy data , 2017, Nature Physics.

[35]  Gueorgi Kossinets,et al.  Empirical Analysis of an Evolving Social Network , 2006, Science.

[36]  Danai Koutra,et al.  Summarizing and understanding large graphs , 2015, Stat. Anal. Data Min..

[37]  Ryan A. Rossi,et al.  Estimation of Graphlet Statistics , 2017, ArXiv.

[38]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[39]  René Vidal,et al.  Sparse subspace clustering , 2009, CVPR.

[40]  Ratha Pech,et al.  A generalized method toward drug-target interaction prediction via low-rank matrix projection , 2017 .

[41]  Leiting Chen,et al.  Enhanced collective influence: A paradigm to optimize network disruption , 2017 .

[42]  Linyuan Lü,et al.  Toward link predictability of complex networks , 2015, Proceedings of the National Academy of Sciences.

[43]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[44]  Pengfei Jiao,et al.  A perturbation-based framework for link prediction via non-negative matrix factorization , 2016, Scientific Reports.

[45]  Yunjun Gao,et al.  A Fast Parallel Community Discovery Model on Complex Networks Through Approximate Optimization , 2018, IEEE Transactions on Knowledge and Data Engineering.

[46]  Roger Guimerà,et al.  Missing and spurious interactions and the reconstruction of complex networks , 2009, Proceedings of the National Academy of Sciences.

[47]  D. Bu,et al.  Topological structure analysis of the protein-protein interaction network in budding yeast. , 2003, Nucleic acids research.

[48]  D. Baird,et al.  Assessment of spatial and temporal variability in ecosystem attributes of the St Marks national wildlife refuge, Apalachee bay, Florida , 1998 .

[49]  M. E. J. Newman,et al.  Estimating network structure from unreliable measurements , 2018, Physical Review E.

[50]  Hong Cheng,et al.  Link prediction via matrix completion , 2016, ArXiv.

[51]  Ian T. Jolliffe,et al.  Principal Component Analysis , 2002, International Encyclopedia of Statistical Science.

[52]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[53]  Philip S. Yu,et al.  Limiting link disclosure in social network analysis through subgraph-wise perturbation , 2012, EDBT '12.

[54]  Emmanuel J. Candès,et al.  A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..