Epidemic processes in complex networks
In recent years the research community has accumulated overwhelming evidence for the
emergence of complex and heterogeneous connectivity patterns in a wide range of …
emergence of complex and heterogeneous connectivity patterns in a wide range of …
Assortativity in complex networks
R Noldus, P Van Mieghem - Journal of Complex Networks, 2015 - academic.oup.com
We survey the concept of assortativity, starting from its original definition by Newman in
2002. Degree assortativity is the most commonly used form of assortativity. Degree …
2002. Degree assortativity is the most commonly used form of assortativity. Degree …
Network science
AL Barabási - … Transactions of the Royal Society A …, 2013 - royalsocietypublishing.org
Professor Barabási's talk described how the tools of network science can help understand
the Web's structure, development and weaknesses. The Web is an information network, in …
the Web's structure, development and weaknesses. The Web is an information network, in …
[图书][B] Graph spectra for complex networks
P Van Mieghem - 2023 - books.google.com
This concise and self-contained introduction builds up the spectral theory of graphs from
scratch, with linear algebra and the theory of polynomials developed in the later parts. The …
scratch, with linear algebra and the theory of polynomials developed in the later parts. The …
The N-intertwined SIS epidemic network model
P Van Mieghem - Computing, 2011 - Springer
Serious epidemics, both in cyber space as well as in our real world, are expected to occur
with high probability, which justifies investigations in virus spread models in (contact) …
with high probability, which justifies investigations in virus spread models in (contact) …
Decreasing the spectral radius of a graph by link removals
The decrease of the spectral radius, an important characterizer of network dynamics, by
removing links is investigated. The minimization of the spectral radius by removing m links is …
removing links is investigated. The minimization of the spectral radius by removing m links is …
Pseudoinverse of the Laplacian and best spreader node in a network
Determining a set of “important” nodes in a network constitutes a basic endeavor in network
science. Inspired by electrical flows in a resistor network, we propose the best conducting …
science. Inspired by electrical flows in a resistor network, we propose the best conducting …
Susceptible-infected-susceptible model: A comparison of -intertwined and heterogeneous mean-field approximations
We introduce the ɛ-susceptible-infected-susceptible (SIS) spreading model, which is taken
as a benchmark for the comparison between the N-intertwined approximation and the Pastor …
as a benchmark for the comparison between the N-intertwined approximation and the Pastor …
Synaptic reorganization of synchronized neuronal networks with synaptic weight and structural plasticity
Abnormally strong neural synchronization may impair brain function, as observed in several
brain disorders. We computationally study how neuronal dynamics, synaptic weights, and …
brain disorders. We computationally study how neuronal dynamics, synaptic weights, and …
The robustness of interdependent clustered networks
It was recently found that cascading failures can cause the abrupt breakdown of a system of
interdependent networks. Using the percolation method developed for single clustered …
interdependent networks. Using the percolation method developed for single clustered …