Searched for: author:"Devriendt, K.L.T."
(1 - 4 of 4)
document
Devriendt, K.L.T. (author), Van Mieghem, P.F.A. (author)
The cut-set ∂V in a graph is defined as the set of all links between a set of nodes V and all other nodes in that graph. Finding bounds for the size of a cut-set |∂V| is an important problem, and is related to mixing times, connectedness and spreading processes on networks. A standard way to bound the number of links in a cut-set |∂V| relies...
journal article 2019
document
Çetinay Iyicil, H. (author), Devriendt, K.L.T. (author), Van Mieghem, P.F.A. (author)
Due to the open data policies, nowadays, some countries have their power grid data available online. This may bring a new concern to the power grid operators in terms of malicious threats. In this paper, we assess the vulnerability of power grids to targeted attacks based on network science. By employing two graph models for power grids as...
journal article 2018
document
Van Mieghem, P.F.A. (author), Devriendt, K.L.T. (author), Çetinay Iyicil, H. (author)
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 node j in a graph G as the minimizer of the diagonal element Qjj† of the pseudoinverse matrix Q† of the weighted Laplacian matrix of the graph G. We propose a...
journal article 2017
document
Devriendt, K.L.T. (author), Van Mieghem, P.F.A. (author)
We propose an approximation framework that unifies and generalizes a number of existing mean-field approximation methods for the susceptible-infected-susceptible (SIS) epidemic model on complex networks. We derive the framework, which we call the unified mean-field framework (UMFF), as a set of approximations of the exact Markovian SIS...
journal article 2017
Searched for: author:"Devriendt, K.L.T."
(1 - 4 of 4)