General optimization framework for accurate and efficient reconstruction of symmetric complex networks from dynamical data.

Abstract

The challenging problem of network reconstruction from dynamical data can in general be formulated as an optimization task of solving multiple linear equations. Existing approaches are of the two types: Point-by-point (PBP) and global methods. The local PBP method is computationally efficient, but the accuracies of its solutions are somehow low, while a global method has the opposite traits: High accuracy and high computational cost. Taking advantage of the network symmetry, we develop a novel framework integrating the advantages of both the PBP and global methods while avoiding their shortcomings: i.e., high reconstruction accuracy is guaranteed, but the computational cost is orders of magnitude lower than that of the global methods in the literature. The mathematical principle underlying our framework is block coordinate descent (BCD) for solving optimization problems, where the various blocks are determined by the network symmetry. The reconstruction framework is validated by numerical examples with a variety of network structures (i.e., sparse and dense networks) and dynamical processes. Our success is a demonstration that the general principle of exploiting symmetry can be extended to tackling the challenging inverse problem or reverse engineering of complex networks. Since solving a large number of linear equationsis key to a plethora of problems in science and engineering, our BCD-based network reconstruction framework will find broader applications.