Ipsen M, Mikhailov AS. Evolutionary reconstruction of networks.
PHYSICAL REVIEW E 2002;
66:046109. [PMID:
12443261 DOI:
10.1103/physreve.66.046109]
[Citation(s) in RCA: 60] [Impact Index Per Article: 2.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 11/09/2001] [Revised: 05/21/2002] [Indexed: 11/06/2022]
Abstract
Can a graph specifying the pattern of connections of a dynamical network be reconstructed from statistical properties of a signal generated by such a system? In this model study, we present a Metropolis algorithm for reconstruction of graphs from their Laplacian spectra. Through a stochastic process of mutations and selection, evolving test networks converge to a reference graph. Applying the method to several examples of random graphs, clustered graphs, and small-world networks, we show that the proposed stochastic evolution allows exact reconstruction of relatively small networks and yields good approximations in the case of large sizes.
Collapse