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

How Much do Your Friends Tell About You?: Reconstructing Private Information from the Friendship Graph

Blenn, N. (author), Doerr, C. (author), Shadravan, N. (author), Van Mieghem, P. (author)

After the early land rush and fast exponential growth of online social networking platforms, concerns about how data placed in online social networks may be exploited and abused have begun to appear among mainstream users. Social networking sites have responded to these new public sentiments by introducing privacy filters to their site, allowing...

conference paper 2012

document

Gossip-based counting in dynamic networks

Van de Bovenkamp, R. (author), Kuipers, F. (author), Van Mieghem, P. (author)

We propose Gossipico, a gossip algorithm to average, sum or find minima and maxima over node values in a large, distributed, and dynamic network. Unlike previous work, Gossipico provides a continuous estimate of, for example, the number of nodes, even when the network becomes disconnected. Gossipico converges quickly due to the introduction of a...

conference paper 2012

document

Epidemic phase transition of the SIS type in networks

Van Mieghem, P. (author)

conference paper 2012

document

Lognormal distribution in the digg online social network

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

The N-intertwined SIS epidemic network model

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

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

Optimization of network protection against virus spread

Gourdin, E. (author), Omic, J. (author), Van Mieghem, P. (author)

The effect of virus spreading in a telecommunication network, where a certain curing strategy is deployed, can be captured by epidemic models. In the N-intertwined model proposed and studied in [1], [2], the probability of each node to be infected depends on the curing and infection rate of its neighbors. In this paper, we consider the case...

conference paper 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

Are Friends Overrated?: A Study for the Social Aggregator Digg.com

Doerr, C. (author), Tang, S. (author), Blenn, N. (author), Van Mieghem, P. (author)

The key feature of online social networks is the ability of users to become active, make friends and interact with those around them. Such interaction is typically perceived as critical to these platforms; therefore, a significant share of research has investigated the characteristics of social links, friendship relations, community structure,...

conference paper 2011

document

Correlating the topology of a metabolic network with its growth capacity

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

conference paper 2010

document

Metabolic network destruction: Relating topology to robustness

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

Spectral graph analysis of modularity and assortativity

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

Pandemics and networks: The case of the Mexican flu

Omic, J. (author), Van Mieghem, P. (author)

The recent widespread of the new Mexican flu and SARS show the high dependency on contemporary traveling patterns. The air transport network is recognized as an important channel of epidemic propagation for different diseases. In order to predict epidemic spreading and the influence of protection measures, a mathematical model of the Susceptible...

conference paper 2010

document

Impairment-aware path selection and regenerator placement in translucent optical networks

Kuipers, F.A. (author), Beshir, A.A. (author), Orda, A. (author), Van Mieghem, P. (author)

Physical impairments, such as noise and signal distortions, negatively affect the quality of information transfer in optical networks. The effect of physical impairments predominantly augments with distance and bit rate of the signal to the point that it becomes detrimental to the information transfer. To reverse the effect of physical...

conference paper 2010

document

Emergence of modular structure in a large-scale brain network with interactions between dynamics and connectivity

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

Network protection against worms and cascading failures using modularity partitioning

Omic, J. (author), Hernandez, J.M. (author), Van Mieghem, P. (author)

Communication networks are prone to virus and worms spreading and cascading failures. Recently, a number of social networking worms have spread over public Web sites. Another example is error propagation in routing tables, such as in BGP tables. The immunization and error curing applied to these scenarios are not fast enough. There have been...

conference paper 2010

document

Effect of tumor resection on the characteristics of functional brain networks

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

Influence of assortativity and degree-preserving rewiring on the spectra of networks

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