Searched for: +
(1 - 20 of 40)

Pages

document
Jamakovic, A. (author), Wang, H. (author), Van Mieghem, P. (author)
conference paper 2006
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
document
Martin Hernandez, J. (author), Kleiberg, T. (author), Wang, H. (author), Van Mieghem, P. (author)
conference paper 2007
document
Tang, S. (author), Wang, H. (author), Van Mieghem, P. (author)
conference paper 2008
document
Kuipers, F.A. (author), Wang, H. (author), Van Mieghem, P. (author)
conference paper 2005
document
Winterbach, W. (author), Wang, H. (author), Reinders, M. (author), Van Mieghem, P. (author), De Ridder, D. (author)
Biological networks exhibit intriguing topological properties such as small-worldness. In this paper, we investigate whether the topology of a metabolic network is related to its robustness. We do so by perturbing a metabolic system in silico, one reaction at a time and studying the correlations between growth, as predicted by flux balance...
conference paper 2010
document
Wang, H. (author), Van Mieghem, P. (author)
conference paper 2007
document
Wang, H. (author), Van Mieghem, P. (author)
conference paper 2008
document
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
Winterbach, W. (author), Wang, H. (author), Reinders, M. (author), Van Mieghem, P. (author), De Ridder, D. (author)
conference paper 2010
document
Wang, H. (author), Van Mieghem, P. (author)
conference paper 2007
document
Winterbach, W. (author), De Ridder, D. (author), Wang, H.J. (author), Reinders, M. (author), Van Mieghem, P. (author)
conference paper 2012
document
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
Van Mieghem, P. (author), Wang, H. (author)
journal article 2009
document
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
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
Stam, C.J. (author), Hillebrand, A. (author), Wang, H. (author), Van Mieghem, P. (author)
A network of 32 or 64 connected neural masses, each representing a large population of interacting excitatory and inhibitory neurons and generating an electroencephalography/magnetoencephalography like output signal, was used to demonstrate how an interaction between dynamics and connectivity might explain the emergence of complex network...
journal article 2010
document
Van Mieghem, P. (author), Wang, H. (author), Ge, X. (author), Tang, S. (author), Kuipers, F.A. (author)
Newman’s measure for (dis)assortativity, the linear degree correlation coefficient ?D, is reformulated in terms of the total number Nk of walks in the graph with k hops. This reformulation allows us to derive a new formula from which a degree-preserving rewiring algorithm is deduced, that, in each rewiring step, either increases or decreases ?D...
journal article 2010
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
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
Searched for: +
(1 - 20 of 40)

Pages