Journals
- Cator, E. , R. van de Bovenkamp and P. Van Mieghem, 2013, "Susceptible-Infected-Susceptible Epidemics on Networks with General Infection and Curing Times", submitted.
- Doerr, C., N. Blenn and P. Van Mieghem, 2013, "Lognormal infection times of online information spread", PLOS ONE, Vol. 8, No. 5, p. e64349 (doi:10.1371/journal.pone.0064349).
- Trajanovski, S., J. Martin-Hernandez, W. Winterbach and P. Van Mieghem, 2013, "Robustness Envelopes of Networks" , Journal of Complex Networks, to appear.
- Van Mieghem, P. and R. van de Bovenkamp, 2013, "Non-Markovian infection spread dramatically alters the SIS epidemic threshold in networks", Physical Review Letters, vol. 110, No. 10, March, p. 108701.
- Liu, D., S. Trajanovski and P. Van Mieghem, 2013, "Random Line Graphs and a linear Law for the Assortativity", Physical Review E, Vol.87, No.1, January, p. 012816.
- Darabi Sahneh, F., C. Scoglio and P. Van Mieghem, 2013, "Generalized Epidemic Mean-Field Model for Spreading Processes over Multi-Layer Complex Networks", IEEE/ACM Transactions on Networking, to appear.
- Trajanovski, S., F. A. Kuipers, J. Martin-Hernandez and P. Van Mieghem, 2013,"Generating graphs that approach a prescribed modularity", Computer Communications, vol. 36, p. 363-372.
- Cator, E. and P. Van Mieghem, 2013, "Susceptible-Infected-Susceptible Epidemics on the Complete Graph and the Star Graph: Exact Analysis", Physical Review E, vol. 87, January, p. 012811.
- Li, C., R. van de Bovenkamp and P. Van Mieghem, 2012, "The SIS mean-fïeld N-intertwined and Pastor-Satorras & Vespignani approximation: a comparison", Physical Review E, vol. 86, No. 2, August, p. 026116.
- Van Mieghem, P. and E. Cator, 2012, "Epidemics in networks with nodal self-infection and the epidemic threshold", Physical Review E, vol. 86, No. 1, July, p. 016116.
- Trajanovski, S., H. Wang and P. Van Mieghem, 2012, "Maximum modular graphs", The European Physical Journal B, vol. 85, No. 7, July, article 244.
- Van Mieghem, P., 2012, "The Viral Conductance of a Network", Computer Communications, Vol 35, No. 12, pp. 1494-1509.
- de Haan, W., W. M. van der Flier, H. Wang, P. Van Mieghem, P. Scheltens and C. J. Stam, 2012, "Disruption of functional brain networks in Alzheimer’s disease: what can we learn from graph spectral analysis of resting-state MEG?", Brain Connectivity, Vol. 2, No. 2, pp. 45-55.
- E. Cator and P. Van Mieghem, 2012, "Second-order mean-field susceptible-infected-susceptible epidemic threshold", Physical Review E, vol. 85, No. 5, May, p. 056111.
- Winterbach, W., D. de Ridder, H. Wang, M. Reinders and P. Van Mieghem, 2012, "Do greedy assortativity optimization algorithms produce good results?", The European Physical Journal B, vol. 85, No. 5, May, article 151.
- Li, C., H. Wang and P. Van Mieghem, 2012, "Bounds for the spectral radius of a graph when nodes are removed", Linear Algebra and its Applications, vol. 437, pp. 319-323.
- Van Mieghem, P., 2012, "Epidemic Phase Transition of the SIS-type in Networks", Europhysics Letters (EPL), Vol. 97, Februari, p. 48004.
- Li, C., H. Wang, W. de Haan, C. J. Stam, P. Van Mieghem, 2011, "The Correlation of Metrics in Complex Networks with Applications in Functional Brain Networks", Journal of Statistical Mechanics: Theory and Experiment (JSTAT), issue November 2011, P11018.
- Van Mieghem, P., 2011, "The N -Intertwined SIS epidemic network model", Computing (Springer), Vol. 93, Issue 2, p. 147-169.
- Van Mieghem, P., 2011, "Human psychology of common appraisal: the Reddit score", IEEE Transactions on Multimedia, Vol. 13, No. 6 (December), pp. 1404-1406.
- Van Mieghem, P., N. Blenn and C. Doerr, 2011,"Lognormal Distribution in the Digg Online Social Network", The European Physical Journal B, Vol. 83, No. 2, pp. 251-261.
- Wang, H., W. Winterbach and P. Van Mieghem, 2011, "Assortativity of Complementary Graphs", The European Physical Journal B, Vol. 83, No. 2, pp. 203-214.
- Van Mieghem, P., D. Stevanovi
c, F. A. Kuipers, C. Li, R. van de Bovenkamp, D. Liu and H. Wang, 2011,"Decreasing the spectral radius of a graph by link removals", Physical Review E, Vol. 84, No. 1, July, p. 016101. - Tang, S., N. Blenn, C. Doerr and P. Van Mieghem, 2011, "Digging in the Digg Social News Website", IEEE Transactions on Multimedia, Vol. 13, No. 5, October, pp. 1163-1175.
- Wang, H., E. van Boven, A. Krishnakumar, M. Hosseini, H. van Hooff, T. Takema, N. Baken and P. Van Mieghem, 2011, "Multi-weighted Monetary Transaction Network", Advances in Complex Systems, Vol. 14, No. 5, pp 691-710.
- Ellens, W. , F. A. Spieksma, P. Van Mieghem, A. Jamakovic and R. E. Kooij, 2011, "Effective Graph Resistance", Linear Algebra and its Applications, Vol. 435, pp. 2491-2506.
- Tang, S., E. Jaho, I. Stavrakakis, I. Koukoutsidis and P. Van Mieghem, 2011, "Modeling Gossip-based Content Dissemination and Search in Distributed Networking", Computer Communications, vol 34, pp. 765-779.
- Van Mieghem, P., X. Ge, P. Schumm, S. Trajanovski and H. Wang, 2010, "Spectral Graph Analysis of Modularity and Assortativity", Physical Review E, Vol. 82, November, p. 056113.
- Stam, C. J., A. Hillebrand, H. Wang, and P. Van Mieghem, 2010, "Emergence of modular structure in a large-scale brain network with interactions between dynamics and connectivity", Frontiers in Computational Neuroscience, Vol. 4, article 133, September, pp. 1-13.
- Wang, H., L. Douw, J. M. Hernández, J.C. Reijneveld, C. J. Stam and P. Van Mieghem, 2010, "Effect of tumor resection on the characteristics of functional brain networks", Physical Review E, Vol 82, p. 021924.
- Wang, H., R.E. Kooij and P. Van Mieghem, 2010, "Graphs with given diameter maximizing the algebraic connectivity", Linear Algebra and its Applications, Vol. 433, No. 11, pp. 1889-1908.
- Van Mieghem, P., H. Wang, X. Ge, S. Tang and F. A. Kuipers, 2010, "Influence of Assortativity and Degree-preserving Rewiring on the Spectra of Networks", The European Physical Journal B, vol. 76, No. 4, pp. 643-652.
- Van Mieghem, P., 2010, "Weight of a link in a shortest path tree and the Dedekind Eta function", Random Structures and Algorithms, Volume 36, No. 3, May, pp. 341-371.
- Liu, D, Wang, H, and P. Van Mieghem, 2010, "Spectral Perturbation and Reconstructability of Complex Networks", Physical Review E, Vol. 81, Januari, p. 016101.
- Wang, H, and P. Van Mieghem, 2010, "Sampling networks by the union of m shortest path trees", Computer Networks, Vol. 54, pp. 1042-1053.
- Van Mieghem, P., J. S. Omic and R. E. Kooij, 2009, "Virus Spread in Networks", IEEE/ACM Transaction on Networking, Vol. 17, No. 1, February, pp. 1-14.
- Van Mieghem, P. and H. Wang, 2009, "The Observable Part of a Network", IEEE/ACM Transaction on Networking, Vol. 17, No. 1, February, pp. 93-105.
- Hooghiemstra, G. and P. Van Mieghem, 2008, "The weight and hopcount of the shortest path in the complete graph with exponential weights", Combinatorics, Probability and Computing, Vol. 17, No. 4, pp. 537-548.
- S. G. Walker and P. Van Mieghem, 2008, "On Lower Bounds for the Largest Eigenvalue of a Symmetric Matrix", Linear Algebra and its Applications, Vol. 429, No. 2-3, July, pp. 519-526.
- Wang, H, J. Martin Hernandez and P. Van Mieghem, 2008, "Betweenness Centrality in Weighted Networks", Physical Review E, vol. 77, April, p. 046105.
- Zhou, X., M. Jacobsson, H. Uijterwaal and P. Van Mieghem, 2008, "IPv6 Delay and Loss Performance Evolution", International Journal of Communication Systems, Vol. 21, No. 6, pp. 643-663.
- Lua, E. K., X. Zhou, J. Crowcroft and P. Van Mieghem, 2008, "Scalable multicasting with network-aware geometric overlay", Computer Communications, vol. 31, pp. 464-488.
- Van Mieghem, P., and S. Tang, 2008, "Weight of the Shortest Path to the First Encountered Peer in a Peer Group of Size m", Probability in the Engineering and Informational Sciences (PEIS), vol. 22, pp. 37-52.
- Van Mieghem, P., 2007, "A new type of lower bound for the largest eigenvalue of a symmetric matrix", Linear Algebra and its Applications, Vol. 427, No. 1, November, p. 119-129.
- Dhillon, S. S. and P. Van Mieghem, 2007, "Performance Analysis of the AntNet Algorithm", Computer Networks, Vol. 51, No. 8, June 6, p. 2104-2125.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2007, "The Weight of the Shortest Path Tree", Random Structures and Algorithms, Vol. 30, No. 3, May, pp. 359-379.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2006, "Size and Weight of Shortest Path Trees with Exponential Link Weights", Combinatorics, Probability and Computing, vol. 15, pp. 903-926.
- Hekmat, R. and P. Van Mieghem, 2006, "Connectivity in Wireless Ad Hoc Networks with a Log-normal Radio Model", Mobile Networks and Applications, Special Issue: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Vol. 11, No. 3, June, pp. 351-360.
- Masip-Bruin, X., M. Yannuzzi, J. Domingo-Pascual, A. Fonte, M. Curado, E. Monteiro, F. Kuipers, P. Van Mieghem, S. Avallone, G. Ventre, P. Aranda-Gutierrez, M. Hollick, R. Steinmetz, L. Iannone and K. Salamatian, 2006, "Research Challenges in QoS Routing", Computer Communications, Vol. 29, pp. 563-581.
- Janic, M. and P. Van Mieghem, 2006, "On properties of multicast routing trees", International Journal of Communication Systems, vol. 19, No. 1, Februari, pp. 95-114.
- Van Mieghem, P. and S. M. Magdalena, 2005, "A Phase Transition in the Link Weight Structure of Networks", Physical Review E, Vol. 72, November, p. 056138.
- Hooghiemstra, G. and P. Van Mieghem, 2005, "On the Mean Distance in Scale Free Graphs", Methodology and Computing in Applied Probability (MCAP), Vol. 7, pp. 285-306.
- Van Mieghem, P. and S. van Langen, 2005, "Influence of the Link Weight Structure on the Shortest Path", Physical Review E, Vol. 71, May, p. 056113.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2005, "Distances in Random Graphs with Finite Variance Degrees", Random Structures and Algorithms, Vol. 27, No. 1, August, pp. 76-123.
- Kuipers, F. A. and P. Van Mieghem, 2005, "Conditions that impact the Complexity of QoS Routing", IEEE/ACM Transaction on Networking, Vol. 13, No. 4, pp. 717-730.
- Kuipers, F. A. and P. Van Mieghem, 2005, "Non-Dominance in QoS Routing: an Implementational Perspective", IEEE Communications Letters, Vol. 9, No. 3, March, pp. 267-269.
- Van Mieghem, P. and F. A. Kuipers, 2004, "Concepts of Exact Quality of Service Routing Algorithms", IEEE/ACM Transaction on Networking, vol. 12, No. 5, pp. 851-864.
- Van Mieghem, P., 2004, "The Hopcount to an Anycast Group", International Journal of Communication Systems, vol. 17, pp. 269-285.
- Kuipers, F. A., T. Korkmaz, M. Krunz and P. Van Mieghem, 2004, Performance Evaluation of Constraint-Based Path Selection Algorithms, IEEE Network, vol. 18, No. 5, September/October, pp. 16-22.
- Hekmat, R. and P. Van Mieghem, 2004, "Interference in Wireless Multi-hop Ad-hoc Networks and its effect on Network Capacity", Wireless Networks, vol. 10, pp. 389-399.
- Guo, Y., F. A. Kuipers and P. Van Mieghem, 2003, "Link-Disjoint Paths for Reliable QoS Routing", International Journal of Communication Systems, vol. 16, pp. 779-798. This article also appeared in the Journal of the China Railway Society, vol. 27, No. 2, 2005 as "Disjoint Multiple-constrained Path Algorithms".
- Van Mieghem, P. and F. A. Kuipers, 2003, On the Complexity of QoS Routing, Computer Communications, vol. 26, No. 4, March 2003, pp. 376-387.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2002, "The flooding time in the random graph, Extremes, vol. 5, No. 2, June 2002, pp. 111-129.
- Kuipers, F. A., T. Korkmaz, M. Krunz, and P. Van Mieghem, 2002, Overview of Constraint-Based Path Selection Algorithms for QoS Routing, IEEE Communications Magazine, Vol. 40, No. 12, December, pp. 50-55.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2002, "On the covariance of the level sizes in random recursive trees, Random Structures and Algorithms, vol. 20, pp. 519-539.
- Kuipers, F. and P. Van Mieghem, 2002, MAMCRA, A Constrained-based Multicast Routing Algorithm, Computer Communications, vol. 25/8, pp. 801-810.
- Van Mieghem, J.A. and P. Van Mieghem, 2002, "Price-coupled Scheduling for Differentiated Services: Gcm versus GPS", International Journal of Communication Systems, vol. 15, pp. 429-452.
- Van Mieghem, P., G. Hooghiemstra and R. Van der Hofstad, 2001, On the Efficiency of Multicast, IEEE/ACM Transactions on Networking, vol. 9, No. 6, pp. 719-732.
- Van Mieghem, P., 2001, "Paths in the simple Random Graph and the Waxman Graph", Probability in the Engineering and Informational Sciences (PEIS), vol. 15, pp. 535-555.
- Van der Hofstad, R, G. Hooghiemstra and P. Van Mieghem, 2001, "First Passage Percolation on the Random Graph", Probability in the Engineering and Informational Sciences (PEIS), vol. 15, pp. 225-237.
- Van Mieghem, P., H. De Neve and F. Kuipers, 2001, "Hop-by-hop Quality of Service Routing", Computer Networks, vol. 37. No 3-4, pp. 407-423.
- De Neve, H, and P. Van Mieghem, 2000, "TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm", Computer Communications, Vol. 23, pp. 667-679.
- Van Mieghem, P., 1999, "Topology Information Condensation in Hierarchical Networks", Computer Networks, Vol.. 31, no. 20, pp. 2115-2137, November.
- Van Mieghem, P., J. David and G. H. Petit, 1998, "Performance of Cell Loss Priority Management Schemes in Shared Buffers with Poisson Arrivals", European Transactions on Telecommunications, Vol. 9, No. 3, pp. 245-258.
- Van Mieghem, P., B. Steyaert and G.H. Petit, 1997, "Performance of Cell Loss Priority Management Schemes in a Single Sever Queue", International Journal of Communication Systems, vol. 10, pp. 161-180.
- Van Mieghem, P., 1996, "The Asymptotic Behaviour of Queueing Systems: Large Deviations Theory and Dominant Pole Approximation", Queueing Systems, vol. 23, pp. 27-55.
Chapter(s) in Books
- Monsuur, H., R. Kooij and P. Van Mieghem, 2012, Analysing and Modelling the Interconnected Cyberspace, Chapter 8 in Cyber Warfare, Critical Perspectives, edited by P. Ducheine, F. Osinga and J. Soeters, Asser Press, The Hague, The Netherlands.
- Van Mieghem, P. (ed.), F.A. Kuipers, T. Korkmaz, M. Krunz, M. Curado, E. Monteiro, X. Masip-Bruin, J. Solé-Pareta, and S. Sánchez-López, 2003, Quality of Service Routing, Chapter 3 in Quality of Future Internet Services, EU-COST 263 Final Report, edited by Smirnov et al. in Springer LNCS 2856, pp. 80-117.