Pages
- 1
- 2
- 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
- Kuipers, F.A. (author), Wang, H. (author), Van Mieghem, P. (author) conference paper 2005
- document
- Jamakovic, A. (author), Wang, H. (author), Van Mieghem, P. (author) conference paper 2006
- document
- Martin Hernandez, J. (author), Kleiberg, T. (author), Wang, H. (author), Van Mieghem, P. (author) conference paper 2007
- document
- Wang, H. (author), Van Mieghem, P. (author) conference paper 2007
- document
- Wang, H. (author), Van Mieghem, P. (author) conference paper 2007
- document
-
Tang, S. (author), Wang, H. (author), Van Mieghem, P. (author)We revisit the peer selection problem of finding the most nearby peer from an initiating peer. The metrics to assess the closeness between peers are hopcount and delay, respectively. Based on a dense graph model with i.i.d regular link weight, we calculate the probability density function to reach a peer with minimum hopcount and asymptotically...report 2008
- document
- Wang, H. (author), Martin Hernandez, J. (author), Van Mieghem, P. (author) journal article 2008
- document
- Tang, S. (author), Wang, H. (author), Van Mieghem, P. (author) conference paper 2008
- document
- Wang, H. (author), Van Mieghem, P. (author) conference paper 2008
- document
- Van Mieghem, P. (author), Wang, H. (author) journal article 2009
- document
- Van Mieghem, P.F.A. (author), Wang, H. (author), Ge, X (author), Tang, S. (author), Kuipers, F.A. (author) journal article 2010
- 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
-
Wang, H. (author), Kooij, R.E. (author), Van Mieghem, P. (author)We propose a class of graphs G?D(n1, n2, ..., nD+1), containing of a chain of D+1 cliques Kn1 , Kn2 , ..., KnD+1, where neighboring cliques are fully-interconnected. The class of graphs has diameter D and size N = ? 1?i?D+1ni. We prove that this class of graphs can achieve the maximal number of links, the minimum average hopcount, and more...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
-
Wang, H. (author), Douw, L. (author), Hernández, J.M. (author), Reijneveld, J.C. (author), Stam, C.J. (author), Van Mieghem, P. (author)Brain functioning such as cognitive performance depends on the functional interactions between brain areas, namely, the functional brain networks. The functional brain networks of a group of patients with brain tumors are measured before and after tumor resection. In this work, we perform a weighted network analysis to understand the effect of...journal article 2010
- 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.F.A. (author), Ge, X. (author), Schumm, P. (author), Trajanovski, S. (author), Wang, H. (author)Expressions and bounds for Newman’s modularity are presented. These results reveal conditions for or properties of the maximum modularity of a network. The influence of the spectrum of the modularity matrix on the maximum modularity is discussed. The second part of the paper investigates how the maximum modularity, the number of clusters, and...journal article 2010
- 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
- Winterbach, W. (author), Wang, H. (author), Reinders, M. (author), Van Mieghem, P. (author), De Ridder, D. (author) conference paper 2010
Pages
- 1
- 2