Jane Gao joins the C&O department

Jane (Pu) Gao joined the Department of Combinatorics and Optimization (C&O) on May 1, 2014 as a research assistant professor.

Jane completed her PhD in 2010 in the C&O department under the supervision of Professor Nick Wormald. The title of her thesis was Generation and properties of random graphs and analysis of randomized algorithms. She held a Humboldt Research Fellowship at the Max Planck Institute for Informatics (Germany), and then a Natural Sciences and Engineering Research Council of Canada (NSERC) postdoctoral fellowship in the Department of Computer Science at the University of Toronto where she worked with Professor Mike Molloy.

Jane's research is focused on random graph theory, asymptotic graph enumeration and theoretical computer science. Random graphs and other structures arise from problems in theoretical computer science, e.g. random graphs that model large networks, and random processes that mimic the evolution of certain real-world networks. She also analyzes graph parameters and properties that are of interest in the theory of random graphs and hypergraphs.