Piet Van Mieghem

ORCID: 0000-0002-3786-7922
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Complex Network Analysis Techniques
  • Opinion Dynamics and Social Influence
  • Graph theory and applications
  • Network Traffic and Congestion Control
  • COVID-19 epidemiological studies
  • Advanced Optical Network Technologies
  • Peer-to-Peer Network Technologies
  • Mental Health Research Topics
  • Software-Defined Networks and 5G
  • Advanced Graph Theory Research
  • Opportunistic and Delay-Tolerant Networks
  • Mobile Ad Hoc Networks
  • Functional Brain Connectivity Studies
  • Gene Regulatory Network Analysis
  • Stochastic processes and statistical mechanics
  • Caching and Content Delivery
  • Interconnection Networks and Systems
  • Mathematical and Theoretical Epidemiology and Ecology Models
  • Markov Chains and Monte Carlo Methods
  • Bioinformatics and Genomic Networks
  • Matrix Theory and Algorithms
  • Advanced Queuing Theory Analysis
  • Wireless Networks and Protocols
  • Neural dynamics and brain function
  • IPv6, Mobility, Handover, Networks, Security

Delft University of Technology
2016-2025

European Centre for Disease Prevention and Control
2024

University of Oxford
2021

Charité - Universitätsmedizin Berlin
2020

Centre de Physique Théorique
2013

Centre de Physique Théorique
2013

Noldus Information Technology
2009

IMEC
1989-2003

Advanced Network and Services (United States)
2003

Alcatel Lucent (Germany)
1997-2002

Complex networks arise in a wide range of biological and sociotechnical systems. Epidemic spreading is central to our understanding dynamical processes complex networks, interest physicists, mathematicians, epidemiologists, computer social scientists. This review presents the main results paradigmatic models infectious disease modeling generalized contagion processes.

10.1103/revmodphys.87.925 article EN publisher-specific-oa Reviews of Modern Physics 2015-08-31

The influence of the network characteristics on virus spread is analyzed in a new-the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> -intertwined Markov chain-model, whose only approximation lies application mean field theory. quantified detail. model has been compared with exact 2 <sup xmlns:xlink="http://www.w3.org/1999/xlink">N</sup> -state and previously proposed ldquohomogeneousrdquo or ldquolocalrdquo models. sharp epidemic threshold...

10.1109/tnet.2008.925623 article EN IEEE/ACM Transactions on Networking 2008-08-04

10.1016/j.laa.2011.02.024 article EN Linear Algebra and its Applications 2011-06-22

Mean-field deterministic epidemic models have been successful in uncovering several important dynamic properties of stochastic spreading processes over complex networks. In particular, individual-based isolate the impact network topology on dynamics. this paper, existing are generalized to develop a class that includes process multilayer We provide detailed description at agent level where agents interact through different layers, each represented by graph. The set differential equations...

10.1109/tnet.2013.2239658 article EN IEEE/ACM Transactions on Networking 2013-01-29

We survey the concept of assortativity, starting from its original definition by Newman in 2002. Degree assortativity is most commonly used form assortativity. extensively network science. Since degree alone not sufficient as a graph analysis tool, usually combined with other metrics. Much research on considers undirected, non-weighted networks. The needs to be extended encompass also directed links and weighted links. In addition, relation between line graphs, complementary graphs spectra...

10.1093/comnet/cnv005 article EN Journal of Complex Networks 2015-03-26

Constraint-based path selection aims at identifying a that satisfies set of quality service (QoS) constraints. In general, this problem is known to be NP-complete, leading the proposal many heuristic algorithms. We provide an overview these algorithms, focusing on restricted shortest and multi-constrained

10.1109/mcom.2002.1106159 article EN IEEE Communications Magazine 2002-12-01

The random distribution of impurities in a semiconductor host lattice introduces potential fluctuations that allow energy levels within the forbidden gap. This statistical effect distorts unperturbed density states pure semiconductor, and, at high doping concentrations, substantial band tails appear. changes density-of-states function are particularly important determining number free carriers heavily doped semiconductor. Together with many-particle interactions, tailing constitutes one most...

10.1103/revmodphys.64.755 article EN Reviews of Modern Physics 1992-07-01

Serious epidemics, both in cyber space as well our real world, are expected to occur with high probability, which justifies investigations virus spread models (contact) networks. The N-intertwined model of the SIS-type is introduced a promising and analytically tractable steady-state behavior fairly completely determined. Compared exact SIS Markov model, makes only one approximation mean-field kind that results upper bounding for finite network size N improves accuracy N. We review many...

10.1007/s00607-011-0155-y article EN cc-by-nc Computing 2011-10-12

Most real-world networks are not isolated. In order to function fully, they interconnected with other networks, and this interconnection influences their dynamic processes. For example, when the spread of a disease involves two species, dynamics within each species (the contact network) differs from that between network). We model generic using adjacency matrices, A B, in which is 2N*2N matrix depicts connectivity size N, B interconnections two. Using an N-intertwined mean-field...

10.1103/physreve.88.022801 article EN publisher-specific-oa Physical Review E 2013-08-02

The decrease of the spectral radius, an important characterizer network dynamics, by removing links is investigated. minimization radius $m$ shown to be NP-complete problem, which suggests considering heuristic strategies. Several greedy strategies are compared, and several bounds on derived. strategy that removes link $l=i~j$ with largest product $({x}_{1}){}_{i}({x}_{1}){}_{j}$ components eigenvector ${x}_{1}$ belonging adjacency eigenvalue superior other in most cases. Furthermore, a...

10.1103/physreve.84.016101 article EN Physical Review E 2011-07-06

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 characterize and precisely compute epidemic threshold networks. Here, we report rather dramatic effect of nonexponential infection (while still assuming an exponential curing time) by considering Weibullean times with same mean, but different power exponent $\ensuremath{\alpha}$. For...

10.1103/physrevlett.110.108701 article EN Physical Review Letters 2013-03-05

Band-gap narrowing of GaAs as a function doping concentration has been measured using photoluminescence spectroscopy on samples grown by molecular beam epitaxy. Both n- (Si) and p- (Be) doped with concentrations varying from 3×1017 to 3×1018 cm−3 have measured. The experimental results obtained line-shape analysis the spectra taking tailing effects into account are in good agreement recent theoretical calculations. A simple expression for band-gap both n-and p-doped is given.

10.1063/1.343958 article EN Journal of Applied Physics 1989-11-01

The relationship between structural and functional brain networks is still highly debated. Most previous studies have used a single imaging modality to analyze this relationship. In work, we use multimodal data, from MRI, magnetoencephalography, diffusion tensor imaging, assume that there exists mapping the connectivity matrices of resting-state networks. We investigate employing group averaged as well individual data. indeed find significantly high goodness fit level for structure-function...

10.1089/brain.2015.0408 article EN Brain Connectivity 2016-02-10

In recent decades, a number of centrality metrics describing network properties nodes have been proposed to rank the importance nodes. order understand correlations between and approximate high-complexity metric by strongly correlated low-complexity metric, we first study correlation in terms their Pearson coefficient similarity ranking addition considering widely used metrics, introduce new measure, degree mass. The m mass node is sum weighted its neighbors no further than hops away. We...

10.1140/epjb/e2015-50671-y article EN cc-by The European Physical Journal B 2015-03-01
Coming Soon ...