Search

Real-world systems, ranging from social to infrastructural, can be abstracted into complex networks. Promoting the spreading of some typical information (for instance, the commercial message, vaccination guidance, innovation, and political movement) on these networked systems can bring benefits to all aspects of society. In this study, we propose an effective edge-based approach for promoting the spreading of information on complex networks. Specifically, we first quantify the potential influence that the addition of each latent edge (that is, edges that do not exist before) could cause to the information spreading dynamics. Then, we strategically add the latent edges to the original networks according to the potential influence of each latent edge. Numerical simulations verify the effectiveness of our strategy and demonstrate that our strategy outperforms several static strategies, namely, adding the latent edges between nodes with the largest degree or eigenvector centrality. This study provides an effective way to promote the spreading of information by modifying the network structure slightly and helps in understanding what a better network structure for the spreading dynamics is. Besides, the theoretical framework established in this study provides inspirations for the further investigations of edge-based promoting strategies for other spreading dynamics.

The organization of real networks usually embodies both regularities and irregularities, and, in principle, the former can be modeled. The extent to which the formation of a network can be explained coincides with our ability to predict missing links. To understand network organization, we should be able to estimate link predictability. We assume that the regularity of a network is reflected in the consistency of structural features before and after a random removal of a small set of links. Based on the perturbation of the adjacency matrix, we propose a universal structural consistency index that is free of prior knowledge of network organization. Extensive experiments on disparate realworld networks demonstrate that (i) structural consistency is a good estimation of link predictability and (ii) a derivative algorithm outperforms state-of-the-art link prediction methods in both accuracy and robustness. This analysis has further applications in evaluating link prediction algorithms and monitoring sudden changes in evolving network mechanisms. It will provide unique fundamental insights into the above-mentioned academic research fields, and will foster the development of advanced information filtering technologies of interest to information technology practitioners. [ABSTRACT FROM AUTHOR]