Jamakovic, A. and P. Van Mieghem, 2006: The Laplacian Spectrum of Complex Networks, European Conference on Complex Systems (ECCS'06), Oxford, UK, September 25-29.
The set of all eigenvalues of a characteristic matrix of a graph, also referred to as the spectrum, is a well-known topology retrieval method. In this paper, we study the spectrum of the Laplacian matrix of an observable part of the Internet graph at the IPlevel, extracted from traceroute measurements performed via RIPE NCC and PlanetLab. In order to investigate the factors influencing the Laplacian spectrum of the observed graphs, we study the following complex network models: the random graph of Erd?os-Rényi, the smallworld of Watts and Strogatz and the scale-free graph, derived from a Havel-Hakimi powerlaw degree sequence. Along with these complex network models, we also study the corresponding Minimum Spanning Tree (MST). Extensive simulations show that the Laplacian spectra of complex network models differ substantially from the spectra of the observed graphs. However, the Laplacian spectra of the MST in the Erd?os-Rényi random graph with uniformly
distributed link weights does bear resemblance to it. Furthermore, we discuss an extensive set of topological characteristics extracted from the Laplacian spectra of the observed real-world graphs as well as from complex network models.