20,758 research outputs found
Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
Many natural and social systems develop complex networks, that are usually
modelled as random graphs. The eigenvalue spectrum of these graphs provides
information about their structural properties. While the semi-circle law is
known to describe the spectral density of uncorrelated random graphs, much less
is known about the eigenvalues 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 new 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 graphs does not converge to the semi-circle law.
Furthermore, the spectral densities of real-world graphs have specific features
depending on the details of the corresponding models. In particular, scale-free
graphs develop a triangle-like spectral density with a power law tail, while
small-world graphs have a complex spectral density function 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.Comment: 14 pages, 9 figures (corrected typos, added references) accepted for
Phys. Rev.
Robustness surfaces of complex networks
Despite the robustness of complex networks has been extensively studied in
the last decade, there still lacks a unifying framework able to embrace all the
proposed metrics. In the literature there are two open issues related to this
gap: (a) how to dimension several metrics to allow their summation and (b) how
to weight each of the metrics. In this work we propose a solution for the two
aforementioned problems by defining the -value and introducing the concept
of \emph{robustness surface} (). The rationale of our proposal is to
make use of Principal Component Analysis (PCA). We firstly adjust to 1 the
initial robustness of a network. Secondly, we find the most informative
robustness metric under a specific failure scenario. Then, we repeat the
process for several percentage of failures and different realizations of the
failure process. Lastly, we join these values to form the robustness surface,
which allows the visual assessment of network robustness variability. Results
show that a network presents different robustness surfaces (i.e., dissimilar
shapes) depending on the failure scenario and the set of metrics. In addition,
the robustness surface allows the robustness of different networks to be
compared.Comment: submitted to Scientific Report
Dimensionality reduction and spectral properties of multilayer networks
Network representations are useful for describing the structure of a large
variety of complex systems. Although most studies of real-world networks
suppose that nodes are connected by only a single type of edge, most natural
and engineered systems include multiple subsystems and layers of connectivity.
This new paradigm has attracted a great deal of attention and one fundamental
challenge is to characterize multilayer networks both structurally and
dynamically. One way to address this question is to study the spectral
properties of such networks. Here, we apply the framework of graph quotients,
which occurs naturally in this context, and the associated eigenvalue
interlacing results, to the adjacency and Laplacian matrices of undirected
multilayer networks. Specifically, we describe relationships between the
eigenvalue spectra of multilayer networks and their two most natural quotients,
the network of layers and the aggregate network, and show the dynamical
implications of working with either of the two simplified representations. Our
work thus contributes in particular to the study of dynamical processes whose
critical properties are determined by the spectral properties of the underlying
network.Comment: minor changes; pre-published versio
- âŠ