Nelly Litvak

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.

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!”