Efficient Reconstruction of Heterogeneous Networks from Time Series via Compressed Sensing

Recent years have witnessed a rapid development of network reconstruction approaches, especially for a series of methods based on compressed sensing. Although compressed-sensing based methods require much less data than conventional approaches, the compressed sensing for reconstructing heterogeneous networks has not been fully exploited because of hubs. Hub neighbors require much more data to be inferred than small-degree nodes, inducing a cask effect for the reconstruction of heterogeneous networks. Here, a conflict-based method is proposed to overcome the cast effect to considerably reduce data amounts for achieving accurate reconstruction. Moreover, an element elimination method is presented to use the partially available structural information to reduce data requirements. The integration of both methods can further improve the reconstruction performance than separately using each technique. These methods are validated by exploring two evolutionary games taking place in scale-free networks, where individual information is accessible and an attempt to decode the network structure from measurable data is made. The results demonstrate that for all of the cases, much data are saved compared to that in the absence of these two methods. Due to the prevalence of heterogeneous networks in nature and society and the high cost of data acquisition in large-scale networks, these approaches have wide applications in many fields and are valuable for understanding and controlling the collective dynamics of a variety of heterogeneous networked systems.

[1]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[2]  Marc Timme,et al.  Revealing network connectivity from response dynamics. , 2006, Physical review letters.

[3]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

[4]  Yi Tao,et al.  Costly punishment does not always increase cooperation , 2009, Proceedings of the National Academy of Sciences.

[5]  G. Szabó,et al.  Evolutionary games on graphs , 2006, cond-mat/0607344.

[6]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[7]  A. Barabasi,et al.  Taming complexity , 2005 .

[8]  Massimo Fornasier,et al.  Compressive Sensing , 2015, Handbook of Mathematical Methods in Imaging.

[9]  Wen-Xu Wang,et al.  Reconstructing propagation networks with natural diversity and identifying hidden sources , 2014, Nature Communications.

[10]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[12]  David G. Rand,et al.  Winners don’t punish , 2008, Nature.

[13]  J. Romberg Imaging via Compressive Sampling [Introduction to compressive sampling and recovery via convex programming] , 2008 .

[14]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

[15]  Xiao Han,et al.  Robust Reconstruction of Complex Networks from Sparse Data , 2015, Physical review letters.

[16]  Wen-Xu Wang,et al.  Time-series–based prediction of complex oscillator networks via compressive sensing , 2011 .

[17]  M. Nowak,et al.  Evolutionary games and spatial chaos , 1992, Nature.

[18]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[19]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[20]  G. Caldarelli,et al.  The fractal properties of Internet , 2000, cond-mat/0009178.

[21]  J. Romberg,et al.  Imaging via Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[22]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[23]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[24]  Stefan Rotter,et al.  Statistical Significance of Coincident Spikes: Count-Based Versus Rate-Based Statistics , 2002, Neural Computation.

[25]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[26]  Jieping Ye,et al.  Network Reconstruction Based on Evolutionary-Game Data via Compressive Sensing , 2011, Physical Review X.

[27]  Sonja Grün,et al.  Non-parametric significance estimation of joint-spike events by shuffling and resampling , 2003, Neurocomputing.

[28]  Wen-Xu Wang,et al.  Noise bridges dynamical correlation and topology in coupled oscillator networks. , 2010, Physical review letters.

[29]  Reuven Cohen,et al.  Complex Networks: Structure, Robustness and Function , 2010 .

[30]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[31]  S. Strogatz Exploring complex networks , 2001, Nature.

[32]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.