Evolutionary reconstruction of networks

Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

Volumn 66, Issue 4, 2002, Pages 4-

  Ipsen, Mads ^a   Mikhailov, Alexander S ^a  

^a FRITZ HABER INSTITUT DER MAX PLANCK GESELLSCHAFT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INTEGRAL EQUATIONS; ITERATIVE METHODS; LAPLACE TRANSFORMS; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES; SPECTRUM ANALYSIS;

DYNAMICAL NETWORKS; LAPLACIAN SPECTRA; NETWORK-ORGANIZED SYSTEMS; PLASTIC NETWORKS;

GRAPH THEORY;

ARTICLE;

EID: 41349099571     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.66.046109     Document Type: Article

References (21)

1. R. Diestel, Graph Theory (Springer, New York, 1997).
2. B. Bollobäs, Random Graphs (Academic Press, New York, 1985).
3. D. Cvetkovič, M. Doob, and H. Sachs, Spectra of Graphs: Theory and Applications (Johann Ambrosius Barth, Heidelberg, 1995).
4. F. Chung, Spectral Graph Theory (American Mathematical Society, Providence, 1997).
5. M. Newman, Proc. Natl. Acad. Sci. U.S.A. 98, 404 (2001).
6. D. Watts and S. Strogatz, Nature (London) 393, 440 (1998).
7. R. Albert, H. Jeong, and A. Barabási, Nature (London) 401, 130 (1999);S. Chakrabarti et al., Sci. Am. June, 54 (1999).
8. M. Faloutsos, P. Faloutsos, and C. Faloutsos, in Proceedings of ACM Sigcom ’99, Cambridge, MA, 1999 (unpublished), pp. 251–262.
9. R. Cancho and R. Solé, Proc. R. Soc. London, Ser. B 268, 2261 (2001).
10. P. Stange, Biophys. Chem. 79, 233 (1999).
11. L. Amaral, Proc. Natl. Acad. Sci. U.S.A. 97, 11149 (2000).
12. J. Ito and K. Kaneko, Neural Networks 13, 275 (2000);
13. L. Moyano, G. Abramson, and D. Zanette, Europhys. Lett. 22, 223 (2001).
14. R. Albert and A. Barabási, Rev. Mod. Phys. 74, 47 (2002).
15. M. Mitchell, An Introduction to Genetic Algorithms (MIT Press, Cambridge, MA, 1996).
16. A. Mikhailov, J. Phys. A 21, L487 (1988);A. Mikhailov, in Nonlinear Waves: Dynamics and Evolution, edited by A. Gaponov-Grekhov and M. Rabinovich (Springer, Berlin, 1989).
17. N. Metropolis, J. Chem. Phys. 21, 1087 (1953).
18. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecci, Science 220, 671 (1983).
19. G. Golub and C. Loan, Matrix Computations, 3rd ed. (The Johns Hopkins University Press, Baltimore, 1996).
20. I. Kanter, Phys. Rev. Lett. 75, 2614 (1995).
21. For (Formula presented), there is only one pair of connected cospectral graphs. For regular graphs, one pair of size 12, two pairs of size 16, a cospectral quadruple of size 28, seven cospectral pairs of size 25, and a set of 91 cospectral graphs of size 35 have been found [see Ref. 3].