22,697 research outputs found
Spectral Theory of Sparse Non-Hermitian Random Matrices
Sparse non-Hermitian random matrices arise in the study of disordered
physical systems with asymmetric local interactions, and have applications
ranging from neural networks to ecosystem dynamics. The spectral
characteristics of these matrices provide crucial information on system
stability and susceptibility, however, their study is greatly complicated by
the twin challenges of a lack of symmetry and a sparse interaction structure.
In this review we provide a concise and systematic introduction to the main
tools and results in this field. We show how the spectra of sparse
non-Hermitian matrices can be computed via an analogy with infinite dimensional
operators obeying certain recursion relations. With reference to three
illustrative examples --- adjacency matrices of regular oriented graphs,
adjacency matrices of oriented Erd\H{o}s-R\'{e}nyi graphs, and adjacency
matrices of weighted oriented Erd\H{o}s-R\'{e}nyi graphs --- we demonstrate the
use of these methods to obtain both analytic and numerical results for the
spectrum, the spectral distribution, the location of outlier eigenvalues, and
the statistical properties of eigenvectors.Comment: 60 pages, 10 figure
Universal transient behavior in large dynamical systems on networks
We analyze how the transient dynamics of large dynamical systems in the
vicinity of a stationary point, modeled by a set of randomly coupled linear
differential equations, depends on the network topology. We characterize the
transient response of a system through the evolution in time of the squared
norm of the state vector, which is averaged over different realizations of the
initial perturbation. We develop a mathematical formalism that computes this
quantity for graphs that are locally tree-like. We show that for unidirectional
networks the theory simplifies and general analytical results can be derived.
For example, we derive analytical expressions for the average squared norm for
random directed graphs with a prescribed degree distribution. These analytical
results reveal that unidirectional systems exhibit a high degree of
universality in the sense that the average squared norm only depends on a
single parameter encoding the average interaction strength between the
individual constituents. In addition, we derive analytical expressions for the
average squared norm for unidirectional systems with fixed diagonal disorder
and with bimodal diagonal disorder. We illustrate these results with numerical
experiments on large random graphs and on real-world networks.Comment: 19 pages, 7 figures. Substantially enlarged version. Submitted to
Physical Review Researc
Structural patterns in complex networks through spectral analysis
The study of some structural properties of networks is introduced from a graph spectral perspective. First, subgraph centrality of nodes is defined and used to classify essential proteins in a proteomic map. This index is then used to produce a method that allows the identification of superhomogeneous networks. At the same time this method classify non-homogeneous network into three universal classes of structure. We give examples of these classes from networks in different real-world scenarios. Finally, a communicability function is studied and showed as an alternative for defining communities in complex networks. Using this approach a community is unambiguously defined and an algorithm for its identification is proposed and exemplified in a real-world network
- …