Als u wijzigingen in Pure hebt gemaakt, zullen deze hier binnenkort zichtbaar zijn.

Persoonlijk profiel


“Networks are fascinating. They are all around us – from social networks to power grids. Yet we know so little about them and even less we can prove. But we are getting there!”

Research profile

Nelly Litvak is professor in Algorithms for Complex Networks and has a background in Applied Probability and Stochastic Operations Research. She works on mathematical methods and algorithms for complex networks, such as social networks and the WWW. Real-life networks are modeled as random graphs, and algorithms are used to extract information from the massive network data.

The overall goal of her research is to extract value from (Big) Data, focusing on network data. Her research revolves around three main topics: Information extraction and predictions based on data, mathematical analysis of network characteristics and randomized algorithms. The first looks at defining and collecting the correct measurements and data for specific purposes and deducing networks from data. The second examines mathematical properties of algorithms in networks, for example, the famous PageRank that Google invented to rank web pages. The third looks at efficient algorithms for computing network characteristics when the complete network data is not available.

Academic background

Nelly Litvak received her PhD from TU/e / EURANDOM in 2002 and joined the University of Twente, where she became an Associate Professor in 2012. She was a visitor at INRIA, University of South Australia and Columbia University. She joined the TU/e as a part-time professor in 2017. Besides her work on Algorithms for Complex Networks, she has also actively contributed to the area of Healthcare Logistics within the Centre for Healthcare Operations Improvement & Research (CHOIR).  She is a Managing editor of Internet Mathematics. Her teaching career began in 1995, at the Lobachevsky State University of Nizhni Novgorod, Russia. She has developed many courses and innovative teaching methods. Nelly is an author of several best-selling non-fiction books. Besides her academic work, she also gives many public lectures about mathematics and education.

Affiliated with

  • 4TU Applied Mathemarics Institute
  • Data Science Center Eindhoven
  • Institute for Information and Communication Technology - CTIT

Partners in (semi-)industry

  • ABN-AMRO bank
  • Philips Lighting
  • Thales


Vingerafdruk Duik in de onderzoeksthema's waar Nelly V. Litvak actief is. Deze onderwerplabels komen voort uit het werk van deze persoon. Samen vormen ze een unieke vingerafdruk.

Random Graphs Rekenkunde
Scale-free Networks Rekenkunde
Complex networks Engineering en materiaalwetenschappen
Performance Analysis Rekenkunde
Graph Clustering Rekenkunde
Queuing Networks Rekenkunde
Queuing Model Rekenkunde
Oncology Rekenkunde

Netwerk Recente externe samenwerking op landenniveau. Duik in de details door op de stippen te klikken.

Onderzoeksoutput 2000 2019

36 Citaties (Scopus)
88 Downloads (Pure)

Uncovering disassortativity in large scale-free networks

Litvak, N. & Hofstad, van der, R. W., 2013, In : Physical Review E - Statistical, Nonlinear, and Soft Matter Physics. 87, 2, blz. 022801-1/7 7 blz., 022801.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Open Access
Scale-free Networks
Spearman's coefficient
Graph in graph theory
Web Graph
World Wide Web

Learning clusters through information diffusion

Prokhorenkova, L., Tikhonov, A. & Litvak, N., 13 mei 2019, The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019. New York: Association for Computing Machinery, Inc, blz. 3151-3157 7 blz.

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)
28 Downloads (Pure)

Average nearest neighbor degrees in scale-free networks

Yao, D., van der Hoorn, P. & Litvak, N., 1 jan 2018, In : Internet Mathematics. 2018, Januari 10, 38 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Open Access
Scale-free Networks
Complex networks
Nearest Neighbor
Finite Size Effects

Fascinating random networks

Litvak, N. V., 20 apr 2018, Eindhoven: Technische Universiteit Eindhoven. 28 blz.

Onderzoeksoutput: Boek/rapportInaugurale redeAcademic

Open Access
3 Citaties (Scopus)

Mean field analysis of Personalized PageRank with implications for local graph clustering

Avrachenkov, K., Kadavankandy, A. & Litvak, N., 1 nov 2018, In : Journal of Statistical Physics. 173, 3-4, blz. 895-916 22 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Graph Clustering
Mean Field


NPCS Annual Conference

Nelly Litvak & J.K. (Koen) Kok


1 item van Media-aandacht

Pers / media: Vakinhoudelijk commentaar


N.V. Litvak


1 item van Media-aandacht

Pers / media: Vakinhoudelijk commentaar

1st international symposium on web algorithms (ISWAG 2015)

N.V. Litvak


1 item van Media-aandacht

Pers / media: Vakinhoudelijk commentaar


Choosing vertices for sentinel surveillance in graphs using simulation and decision trees

Auteur: Besems, J., 18 jun 2019

Begeleider: Litvak, N. (Afstudeerdocent 1)

Scriptie/masterproef: Bachelor