Global and partitioned reconstructions of undirected complex networks

Abstract

It is a significant challenge to predict the network topology from a small amount of dynamical observations. Different from the usual framework of the node-based reconstruction, two optimization approaches (i.e., the global and partitioned reconstructions) are proposed to infer the structure of undirected networks from dynamics. These approaches are applied to evolutionary games occurring on both homogeneous and heterogeneous networks via compressed sensing, which can more efficiently achieve higher reconstruction accuracy with relatively small amounts of data. Our approaches provide different perspectives on effectively reconstructing complex networks.

6 pages, 2 figures, 1 table; revised version; added numerical results of the PR in Table 1 and expanded Section 4; added 7 references

References in corpus (11)

• Evolutionary games on graphs
• Missing and spurious interactions and the reconstruction of complex networks
• Co-evolution of strategy and structure in complex networks with dynamical linking
• Towards effective payoffs in the prisoner's dilemma game on scale-free networks
• Restricted connections among distinguished players support cooperation
• Epidemic spreading on heterogeneous networks with identical infectivity
• Reconstructing propagation networks with natural diversity and identifying hidden sources
• Revealing networks from dynamics: an introduction
• If players are sparse social dilemmas are too: Importance of percolation for evolution of cooperation
• Robust Reconstruction of Complex Networks from Sparse Data
• Analytical controllability of deterministic scale-free networks and Cayley trees