Searched for: department%3A%22Telecommunications%22
(1 - 12 of 12)
document
Li, C. (author), Van de Bovenkamp, R. (author), Van Mieghem, P.F.A. (author)
We introduce the ?-susceptible-infected-susceptible (SIS) spreading model, which is taken as a benchmark for the comparison between the N-intertwined approximation and the Pastor-Satorras and Vespignani heterogeneous mean-field (HMF) approximation of the SIS model. The N-intertwined approximation, the HMF approximation, and the ?-SIS spreading...
journal article 2012
document
Van Mieghem, P.F.A. (author), Cator, E. (author)
Since the Susceptible-Infected-Susceptible (SIS) epidemic threshold is not precisely defined in spite of its practical importance, the classical SIS epidemic process has been generalized to the ??SIS model, where a node possesses a self-infection rate ?, in addition to a link infection rate ? and a curing rate ?. The exact Markov equations are...
journal article 2012
document
Van Mieghem, P.F.A. (author), Blenn, N. (author), Doerr, C. (author)
We analyse the number of votes, called the digg value, which measures the impact or popularity of submitted information in the Online Social Network Digg. Experiments over five years indicate that the digg value of a story on the first frontpage follows closely a lognormal distribution. While the law of proportionate effect explains lognormal...
journal article 2011
document
Van Mieghem, P.F.A. (author)
Serious epidemics, both in cyber space as well as in our real world, are expected to occur with high probability, which justifies investigations in virus spread models in (contact) networks. The N-intertwined virus spread model of the SIS-type is introduced as a promising and analytically tractablemodel of which the steady-state behavior is...
journal article 2011
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
Wang, H. (author), Winterbach, W. (author), Van Mieghem, P.F.A. (author)
journal article 2011
document
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
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
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
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
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), Martin Hernandez, J. (author), Van Mieghem, P. (author)
journal article 2008
Searched for: department%3A%22Telecommunications%22
(1 - 12 of 12)