arXiv · nlin/0111023
Evolutionary reconstruction of networks
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 an evolutionary 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.
Explore related subjects
Keep this discovery
Mads Ipsen, Alexander S. Mikhailov. 2001-11-09. Evolutionary reconstruction of networks. https://doi.org/10.1103/physreve.66.046109
Cite the original work for its findings. Save a collection to share your selection of sources.