On the robustness of complex networks by using the algebraic connectivity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4982 LNCS, Issue , 2008, Pages 183-194

  Jamakovic, A ^a   Van Mieghem, Piet ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; GRAPH THEORY; INTERCONNECTION NETWORKS; LARGE SCALE SYSTEMS; TELECOMMUNICATION LINKS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; NEXT GENERATION NETWORKS; SENSOR NETWORKS; WIRELESS AD HOC NETWORKS; WIRELESS SENSOR NETWORKS;

ALGEBRAIC CONNECTIVITY; COMPLEX NETWORKS; RANDOM GRAPH;

TELECOMMUNICATION NETWORKS; COMPLEX NETWORKS;

ALGEBRAIC CONNECTIVITY; ANALYTICAL ESTIMATIONS; ASYMPTOTIC BEHAVIORS; COMPLEX NETWORK MODELS; EXTENSIVE SIMULATIONS; INDEPENDENT COMPONENTS; LAPLACIAN MATRICES; SMALLEST EIGENVALUE;

EID: 44649094123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79549-0_16     Document Type: Conference Paper

References (28)

1. Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions. Dover Publications, Inc, NY (1999)
2. Albert, R., Barabasi, A.-L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74(1) (January 2002)
3. Bai, Z., Demmel, J., Dongarra, J., Ruhe, A., van der Vorst, H.: Templates for the solution of Algebraic Eigenvalue Problems: A Practical Guide. SIAM, Philadelphia (2000)
4. Barabasi, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509-512 (1999)
5. Barabasi, A.-L.: Linked. The new science of networks. Perseus, Cambridge (2002)
6. Bollobás, B.: Random graphs, 2nd edn. Cambridge University Press, Cambridge (2001)
7. Bollobás, B., Thomason, A.G.: Random graphs of small order. Random graphs 1983. Annals of Discrete Mathematics 28, 47-97 (1985)
8. Castro, M., Costa, M., Rowstron, A.: Should We Build Gnutella on a Structured Overlay. ACM SIGCOMM Computer Communications Review 34(1), 131-136 (2004)
9. Chung, F.R.K.: Spectral Graph Theory. In: Conference Board of the Mathematical Sciences, American Mathematical Society, Providence, RI, vol. 92 (1997)
10. Cvetkovic, D.M., Doob, M., Sachs, H.: Spectra of Graphs, Theory and Applications, 3rd edn. Johann Ambrosius Barth, Heidelberg (1995)
11. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks. In: From Biological Nets to the Internet and WWW, Oxford University Press, Oxford (2003)
12. Erdos, P., Rényi, A.: On random graphs. Publicationes Mathematicae 6, 290-297 (1959)
13. Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 23, 298-305 (1973)
14. Fuhrmann, T.: On the Topology of Overlay Networks. In: Proceedings of 11th IEEE International Conference on Networks (ICON), pp. 271-276 (2003)
15. Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1985)
16. Jamakovic, A., Van Mieghem, P.: On the robustness of complex networks by using the algebraic connectivity, Technical Report (2007)
17. Janson, S., Knuth, D.E., Luczak, T., Pittel, B.: The birth of the giant component. Random Structures & Algorithms 4, 233-358 (1993)
18. Juhāz, F.: The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs. Discrete Mathematics 96, 59-63 (1991)
19. Merris, R.: Laplacian matrices of graphs: a survey. In: Linear Algebra Applications, vol. 197,198, pp. 143-176 (1994)
20. Merris, R.: A survey of graph Laplacians. In: Linear and Multilinear Algebra, vol. 39, pp. 19-31 (1995)
21. Mohar, B., Alavi, Y., Chartrand, G., Oellermann, O.R., Schwenk, A.J.: The Laplacian spectrum of graphs. Graph Theory, Combinatorics and Applications 2, 871-898 (1991)
22. Mohar, B.: Laplace eigenvalues of graphs: a survey. Discrete Mathematics 109, 198, 171-183 (1992)
23. Mohar, B., Hahn, G., Sabidussi, G.: Some applications of Laplace eigenvalues of graphs. Graph Symmetry: Algebraic Methods and Applications, NATO ASI Ser. C 497, 225-275 (1997)
24. Newman, M.: The structure and function of complex networks. SIAM Review 45, 167-256 (1990)
25. Skiena, S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley, Reading (1990)
26. Van Mieghem, P.: Performance Analysis of Computer Systems and Networks. Cambridge University Press, Cambridge (2006)
27. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393, 440-442 (1999)
28. Watts, D.J.: Small Worlds. The Dynamics of Networks Between Order and Randomness. Princeton University Press, Princeton (1999)