Spectral reconstruction of complex networks

Physica A: Statistical Mechanics and its Applications

Volumn 387, Issue 25, 2008, Pages 6436-6442

  Comellas, Francesc ^a   Diaz Lopez, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Complex networks; Eigenvalues; Laplacian spectrum; Tabu search

Indexed keywords

CHLORINE COMPOUNDS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; ELECTRIC NETWORK TOPOLOGY; LAPLACE TRANSFORMS; OPTIMIZATION; REPAIR; RESTORATION; TOPOLOGY;

COMPLEX NETWORKS; DYNAMIC PROCESSES; EIGENVALUES; EXACT RECONSTRUCTION; LAPLACIAN MATRICES; LAPLACIAN SPECTRUM; NETWORK TOPOLOGIES; OPTIMAL TOPOLOGIES; OPTIMIZATION METHODS; PROTEIN-PROTEIN INTERACTION NETWORKS; SCALE-FREE; SMALL NETWORKS; SMALL WORLDS; SPECTRAL RECONSTRUCTIONS;

TABU SEARCH;

EID: 50849099485     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2008.07.032     Document Type: Article

References (26)

1. Comellas F., and Gago S. Synchronizability of complex networks. J. Phys. A: Math. Theor. 40 (2007) 4483-4492
2. Ipsen M., and Mikhailov A.S. Evolutionary reconstruction of networks. Phys. Rev. E 66 (2002) 046109
3. Goh K.-I., Kahng B., and Kim D. Spectra and eigenvectors of scale-free networks. Phys. Rev. E 64 (2001) 051903
4. Farkas I.J., Derényi I., Barabási A.-L., and Vicsek T. Spectra of real-world graphs: Beyond the semicircle law. Phys. Rev. E. 64 (2001) 026704
5. Banerjee A., and Jost J. Spectral plot properties: Towards a qualitative classification of networks. Netw. Heterog. Media 3 (2008) 395-411
6. Cvetkovic D.M., Doob M., and Sachs H. Spectra of graphs. Theory and Application (1980), Academic Press, New York
7. Chung F.R.K. Spectral Graph Theory (1997), University of Pennsylvania, Philadelphia, PA
8. Barahona M., and Pecora L.M. Synchronization in small-world systems. Phys. Rev. Lett. 89 (2002) 054101
9. van Dam E.R., and Haemers W.H. Which graphs are determined by their spectrum?. Linear Algebra Appl. 373 (2003) 241-272
10. Haemers W.H., and Spence E. Enumeration of cospectral graphs. European J. Combin. 25 (2004) 199-211
11. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Math. J. 23 (1973) 298-305
12. Mohar B. Eigenvalues, diameter and mean distance in graphs. Graphs Combin. 7 (1991) 53-64
13. Strang G. Introduction to Linear Algebra. 3rd ed. (2003), Wellesley-Cambridge Press
14. Bagrow J.P., Bollt E.M., Skufca J.D., and ben-Avraham D. Portraits of complex networks. Europhys. Lett. EPL 81 (2008) 68004
15. Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Ops. Res. 13 (1986) 533-549
16. In: Aarts E., and Lenstra K. (Eds). Local Search in Combinatorial Optimization (1997), John Whiley & Sons Ltd, New York
17. F. Comellas, J. Diaz-Lopez, Spectral reconstruction of networks using combinatorial optimization algorithms. E-print UPC. May 2007. UPCommons http://hdl.handle.net/2117/1037
18. http://www.netlib.org/clapack/; http://www.netlib.org/lapack/
19. Golub G.H., and van Loan C.F. Matrix Computations. 3rd ed. (1996), The Johns Hopkins University Press, Baltimore, MD
20. Demmel J.W. Applied Numerical Linear Algebra (1997), Society for Industrial and Applied Mathematics, Philadelphia
21. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, New York
22. Skiena S. Graph Isomorphism. Section 5.2 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica (1990), Addison-Wesley, Reading, MA pp. 181-187
23. Schmidt D.C., and Druffel L.E. A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices. J. ACM 23 (1976) 433-445
24. Watts D.J., and Strogatz S.H. Collective dynamics of 'small-world' networks. Nature 393 (1998) 440-442
25. Barabasi A.-L., and Bonabeau E. Scale-free networks. Sci. Amer. 288 5 (2003) 50-59
26. Guimerà R., Sales-Pardo M., and Amaral L.A.N. Nature Phys. 3 (2007) 63-69