- document
-
Liu, D. (author), Trajanovski, S. (author), Van Mieghem, P. (author)For a fixed number N of nodes, the number of links L in the line graph H(N,L) can only appear in consecutive intervals, called a band of L. We prove that some consecutive integers can never represent the number of links L in H(N,L), and they are called a bandgap of L. We give the exact expressions of bands and bandgaps of L. We propose a model...journal article 2013
- document
-
Cator, E.A. (author), Van Mieghem, P. (author)Since mean-field approximations for susceptible-infected-susceptible (SIS) epidemics do not always predict the correct scaling of the epidemic threshold of the SIS metastable regime, we propose two novel approaches: (a) an ?-SIS generalized model and (b) a modified SIS model that prevents the epidemic from dying out (i.e., without the...journal article 2013
- document
- Trajanovski, S. (author), Kuipers, F.A. (author), Martin Hernandez, J. (author), Van Mieghem, P.F.A. (author) journal article 2013
- document
-
Liu, D. (author), Blenn, N. (author), Van Mieghem, P.F.A. (author)ur society contains all types of organizations, such as companies, research groups and hobby clubs. Affliation networks, as a large and important portion of social networks, consist of individuals and their affiation relations: Two individuals are connected by a link if they belong to the same organization(s). Affliation networks naturally...journal article 2012
- document
-
Liu, D. (author), Blenn, N. (author), Van Mieghem, P.F.A. (author)Social networks, as well as many other real-world networks, exhibit overlapping community structure. In this paper, we present formulas which facilitate the computation for characterizing the overlapping community structure of networks. A hypergraph representation of networks with overlapping community structure is introduced. Using the...journal article 2012
- 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
-
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
-
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
-
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), Stevanovic, D (author), Kuipers, F.A. (author), Li, C. (author), van de Bovenkamp, R. (author), Liu, D. (author), Wang, H. (author) 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
-
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
-
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
-
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