document

Recovering Power Grids Using Strategies Based on Network Metrics and Greedy Algorithms

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

document

Markov Modulated Process to Model Human Mobility

Chang, Brian (author), Yang, Liufei (author), Sensi, M. (author), Achterberg, M.A. (author), Wang, F. (author), Rinaldi, M. (author), Van Mieghem, P.F.A. (author)

We introduce a Markov Modulated Process (MMP) to describe human mobility. We represent the mobility process as a time-varying graph, where a link specifies a connection between two nodes (humans) at any discrete time step. Each state of the Markov chain encodes a certain modification to the original graph. We show that our MMP model...

conference paper 2022

document

Time dependence of susceptible-infected-susceptible epidemics on networks with nodal self-infections

Van Mieghem, P.F.A. (author), Wang, F. (author)

The average fraction of infected nodes, in short the prevalence, of the Markovian ɛ-SIS (susceptible-infected-susceptible) process with small self-infection rate ɛ>0 exhibits, as a function of time, a typical "two-plateau" behavior, which was first discovered in the complete graph KN. Although the complete graph is often dismissed as an...

journal article 2020

document

Structural transition in interdependent networks with regular interconnections

Wang, X. (author), Kooij, Robert (author), Moreno, Yamir (author), Van Mieghem, P.F.A. (author)

Networks are often made up of several layers that exhibit diverse degrees of interdependencies. An interdependent network consists of a set of graphs G that are interconnected through a weighted interconnection matrix B, where the weight of each intergraph link is a non-negative real number p. Various dynamical processes, such as...

journal article 2019

document

Ranking of Nodal Infection Probability in Susceptible-Infected-Susceptible Epidemic

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

Kemeny's constant and the effective graph resistance

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

A network approach for power grid robustness against cascading failures

Wang, X. (author), Koc, Y. (author), Kooij, R.E. (author), Van Mieghem, P. (author)

Cascading failures are one of the main reasons for blackouts in electrical power grids. Stable power supply requires a robust design of the power grid topology. Currently, the impact of the grid structure on the grid robustness is mainly assessed by purely topological metrics, that fail to capture the fundamental properties of the electrical...

conference paper 2015

document

Correlation between centrality metrics and their application to the opinion model

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

Algebraic Connectivity of Interdependent Networks

Martin-Hernandez, J. (author), Wang, H. (author), Van Mieghem, P. (author), D'Agostino, G. (author)

The algebraic connectivity UN-1, i.e. the second smallest eigenvalue of the Laplacian matrix, plays a crucial role in dynamic phenomena such as diffusion processes, synchronization stability, and network robustness. In this work we study the algebraic connectivity in the general context of interdependent networks, or network-of-networks (NoN)....

journal article 2014

document

Epidemic threshold in directed networks

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

Epidemic threshold and topological structure of susceptible-infectious-susceptible epidemics in adaptive networks

Guo, D. (author), Trajanovski, S. (author), Van de Bovenkamp, R. (author), Wang, H. (author), Van Mieghem, P.F.A. (author)

The interplay between disease dynamics on a network and the dynamics of the structure of that network characterizes many real-world systems of contacts. A continuous-time adaptive susceptible-infectious-susceptible (ASIS) model is introduced in order to investigate this interaction, where a susceptible node avoids infections by breaking its...

journal article 2013

document

Topology of molecular interaction networks

Winterbach, W. (author), Van Mieghem, P. (author), Reinders, M. (author), Wang, H. (author), De Ridder, D. (author)

Molecular interactions are often represented as network models which have become the common language of many areas of biology. Graphs serve as convenient mathematical representations of network models and have themselves become objects of study. Their topology has been intensively researched over the last decade after evidence was found that...

journal article 2013

document

Effect of the interconnected network structure on the epidemic threshold

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

Maximum modular graphs

Trajanovski, S. (author), Wang, H. (author), Van Mieghem, P. (author)

Modularity has been explored as an important quantitative metric for community and cluster detection in networks. Finding the maximum modularity of a given graph has been proven to be NPcomplete and therefore, several heuristic algorithms have been proposed. We investigate the problem of finding the maximum modularity of classes of graphs that...

journal article 2012

document

Disruption of Functional Brain Networks in Alzheimer’s Disease: What Can We Learn from Graph Spectral Analysis of Resting-State Magnetoencephalography?

De Haan, W. (author), Van der Flier, W.M. (author), Wang, H. (author), Van Mieghem, P.F.A. (author), Scheltens, P. (author), Stam, C.J. (author)

In Alzheimer’s disease (AD), structural and functional brain network organization is disturbed. However, many of the present network analysis measures require a priori assumptions and methodological choices that influence outcomes and interpretations. Graph spectral analysis (GSA) is a more direct algebraic method that describes network...

journal article 2012

document

Do greedy assortativity optimization algorithms produce good results?

Winterbach, W. (author), De Ridder, D. (author), Wang, H.J. (author), Reinders, M. (author), Van Mieghem, P. (author)

conference paper 2012

document

The correlation of metrics in complex networks with applications in functional brain networks

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

Assortativity of complementary graphs

Wang, H. (author), Winterbach, W. (author), Van Mieghem, P.F.A. (author)

journal article 2011

document

Decreasing the spectral radius of a graph by link removals

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

Decreasing the spectral radius of a graph by link removals

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