Article

On Cross-Correlation Evaluation Model of Internet Macroscopic Topology by Genetic Algorithm.

JNW 02/2011; 6:230-237. DOI: 10.4304/jnw.6.2.230-237
Source: DBLP
0 Bookmarks
 · 
86 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Many natural and social systems develop complex networks that are usually modeled as random graphs. The eigenvalue spectrum of these graphs provides information about their structural properties. While the semicircle law is known to describe the spectral densities of uncorrelated random graphs, much less is known about the spectra of real-world graphs, describing such complex systems as the Internet, metabolic pathways, networks of power stations, scientific collaborations, or movie actors, which are inherently correlated and usually very sparse. An important limitation in addressing the spectra of these systems is that the numerical determination of the spectra for systems with more than a few thousand nodes is prohibitively time and memory consuming. Making use of recent advances in algorithms for spectral characterization, here we develop methods to determine the eigenvalues of networks comparable in size to real systems, obtaining several surprising results on the spectra of adjacency matrices corresponding to models of real-world graphs. We find that when the number of links grows as the number of nodes, the spectral density of uncorrelated random matrices does not converge to the semicircle law. Furthermore, the spectra of real-world graphs have specific features, depending on the details of the corresponding models. In particular, scale-free graphs develop a trianglelike spectral density with a power-law tail, while small-world graphs have a complex spectral density consisting of several sharp peaks. These and further results indicate that the spectra of correlated graphs represent a practical tool for graph classification and can provide useful insight into the relevant structural properties of real networks.
    Physical Review E 09/2001; 64(2 Pt 2):026704. · 2.31 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Despite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period. Weshow that our power-laws fi, the real data very well resulting in correlation coefficients of 96% or higher.
    ACM SIGCOMM Computer Communication Review 03/2003; · 0.91 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We study the spectra and eigenvectors of the adjacency matrices of scale-free networks when bidirectional interaction is allowed, so that the adjacency matrix is real and symmetric. The spectral density shows an exponential decay around the center, followed by power-law long tails at both spectrum edges. The largest eigenvalue lambda1 depends on system size N as lambda1 approximately N1/4 for large N, and the corresponding eigenfunction is strongly localized at the hub, the vertex with largest degree. The component of the normalized eigenfunction at the hub is of order unity. We also find that the mass gap scales as N(-0.68).
    Physical Review E 12/2001; 64(5 Pt 1):051903. · 2.31 Impact Factor

Full-text

Download
0 Downloads
Available from