Searched for: department:"Architecture"
(1 - 18 of 18)
document
Meier, J. (author), Tewarie, P. (author), Van Mieghem, P. (author)
Communication between brain regions is still insufficiently understood. Applying concepts from network science has shown to be successful in gaining insight in the functioning of the brain. Recent work has implicated that especially shortest paths in the structural brain network seem to play a major role in the communication within the brain. So...
journal article 2015
document
Hooghiemstra, G. (author), Van Mieghem, P. (author)
In this article Gerard Hooghiemstra and Piet van Mieghem explain why the Gauss inequality is overshadowed by the Chebychev inequality. Furthermore, they present a proof of the Gauss inequality in modern notation.
journal article 2015
document
Yu, M. (author), Hillebrand, A. (author), Tewarie, P. (author), Meier, J. (author), Van Dijk, B. (author), Van Mieghem, P. (author), Stam, C.J. (author)
The identification of clusters or communities in complex networks is a reappearing problem. The minimum spanning tree (MST), the tree connecting all nodes with minimum total weight, is regarded as an important transport backbone of the original weighted graph. We hypothesize that the clustering of the MST reveals insight in the hierarchical...
journal article 2015
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
Koç, Y. (author), Warnier, M. (author), Van Mieghem, P. (author), Kooij, R.E. (author), Brazier, F.M.T. (author)
Cascading failures are one of the main reasons for large scale blackouts in power transmission grids. Secure electrical power supply requires, together with careful operation, a robust design of the electrical power grid topology. Currently, the impact of the topology on grid robustness is mainly assessed by purely topological approaches, that...
journal article 2014
document
Cator, E. (author), Van Mieghem, P.F.A. (author)
By invoking the famous Fortuin, Kasteleyn, and Ginibre (FKG) inequality, we prove the conjecture that the correlation of infection at the same time between any pair of nodes in a network cannot be negative for (exact) Markovian susceptible-infected-susceptible (SIS) and susceptible-infected-removed (SIR) epidemics on networks. The truth of the...
journal article 2014
document
Van de Bovenkamp, R. (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)
When two viruses compete for healthy nodes in a simple network and both spreading rates are above the epidemic threshold, only one virus will survive. However, if we prevent the viruses from dying out, rich dynamics emerge. When both viruses are identical, one virus always dominates the other, but the dominating and dominated virus alternate. We...
journal article 2014
document
Liu, D. (author), Trajanovski, S. (author), Van Mieghem, P. (author)
This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H. If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its...
journal article 2014
document
Stam, C.J. (author), Tewarie, P. (author), Van Dellen, E. (author), Van Straaten, E.C.W. (author), Hillebrand, A. (author), Van Mieghem, P. (author)
In recent years there has been a shift in focus from the study of local, mostly task-related activation to the exploration of the organization and functioning of large-scale structural and functional complex brain networks. Progress in the interdisciplinary field of modern network science has introduced many new concepts, analytical tools and...
journal article 2014
document
Trajanovski, S. (author), Kuipers, F.A. (author), Ili?, A. (author), Crowcroft, J. (author), Van Mieghem, P. (author)
Due to their importance to society, communication networks should be built and operated to withstand failures.However, cost considerations make network providers less inclined to take robustness measures against failures that are unlikely to manifest, like several failures coinciding simultaneously in different geographic regions of their...
journal article 2014
document
Martin-Hernandez, J. (author), Li, Z. (author), Van Mieghem, P. (author)
One of the better studied topology metrics of complex networks is the second smallest eigenvalue of the Laplacian matrix of a network’s graph, referred to as the algebraic connectivity mN-1. This spectral metric plays a decisive role in synchronization of coupled oscillators, network robustness, consensus problems, belief propagation, graph...
journal article 2014
document
Winterbach, W. (author), Van Mieghem, P. (author), Reinders, M. (author), Wang, H. (author), De Ridder, D. (author)
Molecular interactions are often represented as network models which have become the common language of many areas of biology. Graphs serve as convenient mathematical representations of network models and have themselves become objects of study. Their topology has been intensively researched over the last decade after evidence was found that...
journal article 2013
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), 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), Omic, J. (author), Kooij, R. (author)
journal article 2009
document
Van Mieghem, P. (author), Wang, H. (author)
journal article 2009
document
Van Mieghem, P. (author), Tang, S. (author)
We model the weight (e.g. delay, distance or cost) from an arbitrary node to the nearest (in weight) peer in a peer-to-peer (P2P) network. The exact probability generating function and an asymptotic analysis is presented for a random graph with i.i.d. exponential link weights. The asymptotic distribution function is a Fermi-Dirac distribution...
journal article
document
Van Mieghem, P (author)
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generating function and the asymptotic law are derived. As a remarkable coincidence, this asymptotic law is precisely the same as the distribution of the cost of one “job” in...
journal article
Searched for: department:"Architecture"
(1 - 18 of 18)