| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
Evolutionary reconstruction of networks | Mads Ipsen
; Alexander S. Mikhailov
; | Date: |
9 Nov 2001 | Subject: | Adaptation and Self-Organizing Systems; Disordered Systems and Neural Networks; Soft Condensed Matter | nlin.AO cond-mat.dis-nn cond-mat.soft | 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. | Source: | arXiv, nlin.AO/0111023 | Other source: | [GID 232117] pmid12443261 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |