Piet Van Mieghem

From MaRDI portal
Person:417594

Available identifiers

zbMath Open van-mieghem.pietMaRDI QIDQ417594

List of research outcomes





PublicationDate of PublicationType
Linear clustering process on networks: a comparative study2024-10-22Paper
Multi-weighted monetary transaction network2024-06-14Paper
Eigenvector components of symmetric, graph-related matrices2024-05-03Paper
https://portal.mardi4nfdi.de/entity/Q61239982024-04-08Paper
Co-eigenvector graphs2024-04-05Paper
Maximum modular graphs2023-07-26Paper
Graph Spectra for Complex Networks2023-07-03Paper
Two-Population SIR Model and Strategies to Reduce Mortality in Pandemics2022-11-15Paper
Markov modulated process to model human mobility2022-10-25Paper
Number of paths in a graph2022-09-19Paper
The spreading time in SIS epidemics on networks2022-06-27Paper
Linear processes on complex networks2022-01-19Paper
Prevalence expansion in NIMFA2022-01-17Paper
The simplex geometry of graphs2021-09-15Paper
Detecting the number of clusters in a network2021-09-15Paper
Clustering for epidemics on networks: A geometric approach2021-07-15Paper
Optimal curing policy for epidemic spreading over a community network with heterogeneous population2021-05-07Paper
Binet's factorial series and extensions to Laplace transforms2021-02-09Paper
Time-dependent solution of the NIMFA equations around the epidemic threshold2021-01-19Paper
The correlation of metrics in complex networks with applications in functional brain networks2020-08-11Paper
Community Networks with Equitable Partitions2020-07-08Paper
Adaptive Networks2020-07-08Paper
The Mittag-Leffler function2020-05-27Paper
Optimal Induced Spreading of SIS Epidemics in Networks2020-01-28Paper
Constructing Laplacian matrices with Soules vectors: inverse eigenvalue problem and applications2019-09-24Paper
Tighter spectral bounds for the cut size, based on Laplacian eigenvectors2019-05-29Paper
Designing Virus-Resistant, High-Performance Networks: A Game-Formation Approach2019-03-29Paper
Degree distribution and assortativity in line graphs of complex networks2018-11-13Paper
Evaluation of an analytic, approximate formula for the time-varying SIS prevalence in different networks2018-11-13Paper
Assortativity in complex networks2018-10-16Paper
Weighted betweenness and algebraic connectivity2018-10-16Paper
A topological investigation of phase transitions of cascading failures in power grids2018-09-20Paper
The impact of the topology on cascading failures in a power grid model2018-09-20Paper
Kemeny's constant and the effective graph resistance2017-10-10Paper
Decentralized Protection Strategies Against SIS Epidemics in Networks2017-09-21Paper
Universal mean-field framework for SIS epidemics on networks, based on graph partitioning and the isoperimetric inequality2017-06-12Paper
https://portal.mardi4nfdi.de/entity/Q55067672016-12-16Paper
Estimating the covariance structure of heterogeneous SIS epidemics on networks2016-09-24Paper
A Lagrange series approach to the spectrum of the Kite2016-01-26Paper
ILIGRA: an efficient inverse line graph algorithm2015-12-01Paper
Performance Analysis of Complex Networks and Systems2014-07-21Paper
Exact Markovian SIR and SIS epidemics on networks and an upper bound for the epidemic threshold2014-02-07Paper
Graph eigenvectors, fundamental weights and centrality metrics for nodes in networks2014-01-18Paper
Decay towards the overall-healthy state in SIS epidemics on networks2013-10-15Paper
Graph Spectra for Complex Networks2013-01-21Paper
Bounds for the spectral radius of a graph when nodes are removed2012-05-14Paper
The \(N\)-intertwined SIS epidemic network model2011-12-14Paper
Effective graph resistance2011-07-13Paper
https://portal.mardi4nfdi.de/entity/Q30668302011-01-12Paper
Weight of a link in a shortest path tree and the Dedekind Eta function2010-11-10Paper
Graphs with given diameter maximizing the algebraic connectivity2010-11-05Paper
Sampling networks by the union of \(m\) shortest path trees2010-05-11Paper
Performance Analysis of Communications Networks and Systems2009-07-31Paper
Performance Analysis of Communications Networks and Systems2009-05-19Paper
The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights2008-09-29Paper
On lower bounds for the largest eigenvalue of a symmetric matrix2008-06-17Paper
A new type of lower bound for the largest eigenvalue of a symmetric matrix2007-10-05Paper
The weight of the shortest path tree2007-05-11Paper
Performance analysis of the AntNet algorithm2007-04-26Paper
Size and Weight of Shortest Path Trees with Exponential Link Weights2007-02-07Paper
On the mean distance in scale free graphs2006-01-17Paper
Distances in random graphs with finite variance degrees2005-08-29Paper
The flooding time in random graphs2004-03-16Paper
https://portal.mardi4nfdi.de/entity/Q44284232003-09-15Paper
https://portal.mardi4nfdi.de/entity/Q44229982003-08-24Paper
Price-coupled scheduling for differentiated services: Gcµversus GPS2003-02-04Paper
On the covariance of the level sizes in random recursive trees2002-08-08Paper
Paths in the simple random graph and the Waxman graph2002-06-30Paper
First-passage percolation on the random graph2001-11-22Paper
The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation1998-01-22Paper
Reverse Line Graph Construction: The Matrix Relabeling Algorithm MARINLINGA Versus Roussopoulos's AlgorithmN/APaper
Transition from time-variant to static networks: timescale separation in NIMFA SIS epidemicsN/APaper

Research outcomes over time

This page was built for person: Piet Van Mieghem