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!
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.
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.
Fascinating random networks(2018)
Average nearest neighbor degrees in scale-free networksInternet Mathematics (2018)
Predicting the long-term citation impact of recent publicationsJournal of Informetrics (2015)
Algorithms and models for the Web graph : 12th international workshop, WAW 2015, Eindhoven, The Netherlands, December 10-11, 2015 : proceedings(2015)
Predicting the long-term citation impact of recent publications(2015)
No ancillary activities