Searched for: +
(1 - 13 of 13)
document
Liu, D. (author), Wang, H. (author), Van Mieghem, P. (author)
In recent years, many network perturbation techniques, such as topological perturbations and service perturbations, were employed to study and improve the robustness of complex networks. However, there is no general way to evaluate the network robustness. In this paper, we propose a global measure for a network, the reconstructability...
journal article 2010
document
Van Mieghem, P.F.A. (author), Stevanovic, D (author), Kuipers, F.A. (author), Li, C. (author), van de Bovenkamp, R. (author), Liu, D. (author), Wang, H. (author)
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
Liu, D. (author), Blenn, N. (author), Van Mieghem, P.F.A. (author)
ur society contains all types of organizations, such as companies, research groups and hobby clubs. Affliation networks, as a large and important portion of social networks, consist of individuals and their affiation relations: Two individuals are connected by a link if they belong to the same organization(s). Affliation networks naturally...
journal article 2012
document
Liu, D. (author), Blenn, N. (author), Van Mieghem, P.F.A. (author)
Social networks, as well as many other real-world networks, exhibit overlapping community structure. In this paper, we present formulas which facilitate the computation for characterizing the overlapping community structure of networks. A hypergraph representation of networks with overlapping community structure is introduced. Using the...
journal article 2012
document
Liu, D. (author), Trajanovski, S. (author), Van Mieghem, P. (author)
For a fixed number N of nodes, the number of links L in the line graph H(N,L) can only appear in consecutive intervals, called a band of L. We prove that some consecutive integers can never represent the number of links L in H(N,L), and they are called a bandgap of L. We give the exact expressions of bands and bandgaps of L. We propose a model...
journal article 2013
document
Liu, D. (author), Trajanovski, S. (author), Van Mieghem, P. (author)
This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H. If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its...
journal article 2014
document
Liu, Q. (author), Van Mieghem, P.F.A. (author)
In this paper, we focus on the autocorrelation of the susceptible-infected-susceptible (SIS) process on networks. The N-intertwined mean-field approximation (NIMFA) is applied to calculate the autocorrelation properties of the exact SIS process. We derive the autocorrelation of the infection state of each node and the fraction of infected...
journal article 2018
document
Liu, Q. (author), Van Mieghem, P.F.A. (author)
Since a real epidemic process is not necessarily Markovian, the epidemic threshold obtained under the Markovian assumption may be not realistic. To understand general non-Markovian epidemic processes on networks, we study the Weibullian susceptible-infected-susceptible (SIS) process in which the infection process is a renewal process with a...
journal article 2018
document
Liu, Q. (author), Van Mieghem, P.F.A. (author)
To shed light on the disease localization phenomenon, we study a bursty susceptible-infected-susceptible (SIS) model and analyze the model under the mean-field approximation. In the bursty SIS model, the infected nodes infect all their neighbors periodically, and the near-threshold steady-state prevalence is non-constant and maximized by a...
journal article 2018
document
Liu, Q. (author), Zhou, Xiaoyu (author), Van Mieghem, P.F.A. (author)
In previous modelling efforts to understand the spreading process on networks, each node can infect its neighbors and cure spontaneously, and the curing is traditionally assumed to occur uniformly over time. This traditional curing is not optimal in terms of the trade-off between the effectiveness and cost. A pulse immunization/curing strategy...
journal article 2019
document
Ma, L. (author), Liu, Q. (author), Van Mieghem, P.F.A. (author)
Dynamical processes running on different networks behave differently, which makes the reconstruction of the underlying network from dynamical observations possible. However, to what level of detail the network properties can be determined from incomplete measurements of the dynamical process is still an open question. In this paper, we focus on...
journal article 2019
document
Wang, F. (author), Cetinay, Hale (author), He, Zhidong (author), Liu, L. (author), Van Mieghem, P.F.A. (author), Kooij, Robert (author)
For this study, we investigated efficient strategies for the recovery of individual links in power grids governed by the direct current (DC) power flow model, under random link failures. Our primary objective was to explore the efficacy of recovering failed links based solely on topological network metrics. In total, we considered 13 recovery...
journal article 2023
Searched for: +
(1 - 13 of 13)