Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Ipsen et al. (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: