Searched for: +
(1 - 20 of 219)

Pages

document
Devriendt, Karel (author), Van Mieghem, P.F.A. (author)
Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods, each of which highlights the properties of graphs in a uniqueway. Here, we discuss a novel approach to study...
review 2019
document
Douw, Linda (author), Dellen, van, Edwin (author), Gouw, Alida A. (author), Griffa, Alessandra (author), de Haan, Willem (author), van den Heuvel, Martijn (author), Hillebrand, Arjan (author), Van Mieghem, P.F.A. (author), Nissen, Ida A. (author)
Clinical network neuroscience, the study of brain network topology in neurological and psychiatric diseases, has become a mainstay field within clinical neuroscience. Being a multidisciplinary group of clinical network neuroscience experts based in The Netherlands, we often discuss the current state of the art and possible avenues for future...
review 2019
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
Beshir, A.A. (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author), Orda, A. (author)
In WDM networks, survivable routing and wavelength assignment (SRWA) involves assigning link-disjoint primary and backup lightpaths. In the on-line SRWA problem, a sequence of requests arrive and each request is either accepted or rejected based only on the input sequence seen so far. For special networks, we establish on-line algorithms with...
report 2009
document
Kuipers, F.A. (author), Beshir, A.A. (author), Orda, A. (author), Van Mieghem, P.F.A. (author)
Physical impairments, such as noise and signal distortions, negatively affect the quality of information transport in optical networks. The effect of physical impairments 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 impairments, the...
report 2009
document
Van Mieghem, P.F.A. (author)
<br/><br/>
report 2017
document
Van Mieghem, P. (author)
public lecture 1999
document
Van Mieghem, P. (author), Wang, H. (author)
journal article 2009
document
Hooghiemstra, G. (author), Van Mieghem, P. (author)
Both the hopcount HN (the number of links) and the weight WN (the sum of the weights on links) of the shortest path between two arbitrary nodes in the complete graph KN with i.i.d. exponential link weights is computed. We consider the joint distribution of the pair (HN,WN) and derive, after proper scaling, the joint limiting distribution. One of...
journal article
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
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
Van Mieghem, P.F.A. (author), Van de Bovenkamp, R. (author)
Most studies on susceptible-infected-susceptible epidemics in networks implicitly assume Markovian behavior: the time to infect a direct neighbor is exponentially distributed. Much effort so far has been devoted to characterize and precisely compute the epidemic threshold in susceptible-infected-susceptible Markovian epidemics on networks. Here,...
journal article 2013
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
Trajanovski, S. (author), Kuipers, F.A. (author), Martín-Hernández, J. (author), Van Mieghem, P. (author)
Modularity is a quantitative measure for characterizing the existence of a community structure in a network. A network's modularity depends on the chosen partitioning of the network into communities, which makes finding the specific partition that leads to the maximum modularity a hard problem. In this paper, we prove that deciding whether a...
journal article 2013
document
Kuipers, F. (author), Korkmaz, T. (author), Krunz, M. (author), Van Mieghem, P. (author)
journal article 2004
document
Trajanovski, S. (author), Martín-Hernández, J. (author), Winterbach, W. (author), Van Mieghem, P. (author)
We study the robustness of networks under node removal, considering random node failure, as well as targeted node attacks based on network centrality measures. Whilst both of these have been studied in the literature, existing approaches tend to study random failure in terms of average-case behavior, giving no idea of how badly network...
journal article 2013
document
Van Mieghem, P.F.A. (author), Van de Bovenkamp, R. (author)
Mean-field approximations (MFAs) are frequently used in physics. When a process (such as an epidemic or a synchronization) on a network is approximated by MFA, a major hurdle is the determination of those graphs for which MFA is reasonably accurate. Here, we present an accuracy criterion for Markovian susceptible-infected-susceptible (SIS)...
journal article 2015
document
Li, C. (author), Li, Q. (author), Van Mieghem, P.F.A. (author), Stanley, H.E. (author), Wang, H. (author)
In recent decades, a number of centrality metrics describing network properties of nodes have been proposed to rank the importance of nodes. In order to understand the correlations between centrality metrics and to approximate a high-complexity centrality metric by a strongly correlated low-complexity metric, we first study the correlation...
journal article 2015
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
Cator, E. (author), Van de Bovenkamp, R. (author), Van Mieghem, P.F.A. (author)
The classical, continuous-time susceptible-infected-susceptible (SIS) Markov epidemic model on an arbitrary network is extended to incorporate infection and curing or recovery times each characterized by a general distribution (rather than an exponential distribution as in Markov processes). This extension, called the generalized SIS (GSIS)...
journal article 2013
Searched for: +
(1 - 20 of 219)

Pages