Searched for: collection%3Air
(1 - 9 of 9)
document
Qu, B. (author), Li, C. (author), Van Mieghem, P.F.A. (author), Wang, H. (author)
The prevalence, which is the average fraction of infected nodes, has been studied to evaluate the robustness of a network subject to the spread of epidemics. We explore the vulnerability (infection probability) of each node in the metastable state with a given effective infection rate τ. Specifically, we investigate the ranking of the nodal...
journal article 2017
document
Li, C. (author), Li, Q. (author), Van Mieghem, P.F.A. (author), Stanley, H.E. (author), Wang, H. (author)
In recent decades, a number of centrality metrics describing network properties of nodes have been proposed to rank the importance of nodes. In order to understand the correlations between centrality metrics and to approximate a high-complexity centrality metric by a strongly correlated low-complexity metric, we first study the correlation...
journal article 2015
document
Martin-Hernandez, J. (author), Li, Z. (author), Van Mieghem, P. (author)
One of the better studied topology metrics of complex networks is the second smallest eigenvalue of the Laplacian matrix of a network’s graph, referred to as the algebraic connectivity mN-1. This spectral metric plays a decisive role in synchronization of coupled oscillators, network robustness, consensus problems, belief propagation, graph...
journal article 2014
document
Li, C. (author), Wang, H. (author), Van Mieghem, P.F.A. (author)
Epidemics have so far been mostly studied in undirected networks. However, many real-world networks, such as the online social network Twitter and the world wide web, on which information, emotion, or malware spreads, are directed networks, composed of both unidirectional links and bidirectional links. We define the directionality ? as the...
journal article 2013
document
Wang, H. (author), Li, Q. (author), D'Agostino, G. (author), Havlin, S. (author), Stanley, H.E. (author), Van Mieghem, P. (author)
Most real-world networks are not isolated. In order to function fully, they are interconnected with other networks, and this interconnection influences their dynamic processes. For example, when the spread of a disease involves two species, the dynamics of the spread within each species (the contact network) differs from that of the spread...
journal article 2013
document
Li, C. (author), Van de Bovenkamp, R. (author), Van Mieghem, P.F.A. (author)
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-Satorras and Vespignani heterogeneous mean-field (HMF) approximation of the SIS model. The N-intertwined approximation, the HMF approximation, and the ?-SIS spreading...
journal article 2012
document
Li, C. (author), Wang, H. (author), De Haan, W. (author), Stam, C.J. (author), Van Mieghem, P.F.A. (author)
An increasing number of network metrics have been applied in network analysis. If metric relations were known better, we could more effectively characterize networks by a small set of metrics to discover the association between network properties/metrics and network functioning. In this paper, we investigate the linear correlation coefficients...
journal article 2011
document
Van Mieghem, P. (author), Stevanovi?, D. (author), Kuipers, F. (author), Li, C. (author), Van de Bovenkamp, R. (author), Liu, D. (author), Wang, H. (author)
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 shown to be an NP-complete problem, which suggests considering heuristic strategies. Several greedy strategies are compared, and several bounds on the decrease of...
journal article 2011
document
Li, C. (author), Wang, H. (author), Van Mieghem, P. (author)
The largest eigenvalue ? 1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the...
conference paper
Searched for: collection%3Air
(1 - 9 of 9)