Searched for: +
(41 - 60 of 219)

Pages

document
Douw, Linda (author), Dellen, van, Edwin (author), Gouw, Alida A. (author), Griffa, Alessandra (author), de Haan, Willem (author), van den Heuvel, Martijn (author), Hillebrand, Arjan (author), Van Mieghem, P.F.A. (author), Nissen, Ida A. (author)
Clinical network neuroscience, the study of brain network topology in neurological and psychiatric diseases, has become a mainstay field within clinical neuroscience. Being a multidisciplinary group of clinical network neuroscience experts based in The Netherlands, we often discuss the current state of the art and possible avenues for future...
review 2019
document
Prasse, B. (author), Van Mieghem, P.F.A. (author)
The SIS dynamics of the spread of a virus crucially depend on both the network topology and the spreading parameters. Since neither the topology nor the spreading parameters are known for the majority of applications, they have to be inferred from observations of the viral spread. We propose an inference method for both topology and spreading...
journal article 2019
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
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
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
Trajanovski, S. (author), Kuipers, F.A. (author), Hayel, Yezekael (author), Altman, Eitan (author), Van Mieghem, P.F.A. (author)
Designing an optimal network topology while balancing multiple, possibly conflicting objectives like cost, performance, and resiliency to viruses is a challenging endeavor, let alone in the case of decentralized network formation. We therefore propose a game-formation technique where each player aims to minimize its cost in installing links,...
journal article 2018
document
Çetinay Iyicil, H. (author), Soltan, Saleh (author), Kuipers, F.A. (author), Zussman, Gil (author), Van Mieghem, P.F.A. (author)
In this paper, we compare the effects of failures in power grids under the nonlinear AC and linearized DC power flow models. First, we numerically demonstrate that when there are no failures and the assumptions underlying the DC model are valid, the DC model approximates the AC model well in four considered test networks. Then, to evaluate...
journal article 2018
document
He, Z. (author), Van Mieghem, P.F.A. (author)
Identifying the fastest spreaders in epidemics on a network helps to ensure an efficient spreading. By ranking the average spreading time for different spreaders, we show that the fastest spreader may change with the effective infection rate of a SIS epidemic process, which means that the time-dependent influence of a node is usually strongly...
journal article 2018
document
Çetinay Iyicil, H. (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)
This paper combines the fundamentals of an electrical grid, such as flow allocation according to Kirchhoff’s laws and the effect of transmission line reactances with spectral graph theory, and expresses the linearized power flow behaviour in slack-bus independent weighted graph matrices to assess the relation between the topological structure...
journal article 2018
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
Ç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
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
Van Mieghem, P.F.A. (author)
<br/><br/>
report 2017
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
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
Wang, X. (author), Dubbeldam, J.L.A. (author), Van Mieghem, P.F.A. (author)
Kemeny's constant and its relation to the effective graph resistance has been established for regular graphs by Palacios et al. [1]. Based on the Moore–Penrose pseudo-inverse of the Laplacian matrix, we derive a new closed-form formula and deduce upper and lower bounds for the Kemeny constant. Furthermore, we generalize the relation between...
journal article 2017
document
Märtens, M. (author), Meier, J.M. (author), Hillebrand, Arjan (author), Tewarie, Prejaas (author), Van Mieghem, P.F.A. (author)
Recent work has revealed frequency-dependent global patterns of information flow by a network analysis of magnetoencephalography data of the human brain. However, it is unknown which properties on a small subgraph-scale of those functional brain networks are dominant at different frequencies bands. Motifs are the building blocks of networks on...
journal article 2017
document
Çetinay Iyicil, H. (author), Soltan, Saleh (author), Kuipers, F.A. (author), Zussman, Gil (author), Van Mieghem, P.F.A. (author)
In this paper, we study cascading failures in power grids under the nonlinear AC and linearized DC power flow models. We numerically compare the evolution of cascades after single line failures under the two flow models in four test networks. The cascade simulations demonstrate that the assumptions underlying the DC model (e.g., ignoring power...
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
document
Märtens, M. (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)
Networks are continuously growing in complexity, which creates challenges for determining their most important characteristics. While analytical bounds are often too conservative, the computational effort of algorithmic approaches does not scale well with network size. This work uses Cartesian Genetic Programming for symbolic regression to...
conference paper 2017
Searched for: +
(41 - 60 of 219)

Pages