Jane completed her Ph.D. in 2010 in the C&O department under the supervision of Professor Nick Wormald. Her thesis was entitled "Generation and properties of random graphs and analysis of randomized algorithms". Jane was previously a lecturer and ARC DECRA Fellow in the School of Mathematical Sciences at Monash University. Prior to that position, she held postdoctoral fellowships at the Max Planck Institute for Informatics (Saarbruecken) and the University of Toronto, and a research assistant professorship at Waterloo.
Jane's research interests are in random graph theory, random constraint satisfaction problems, randomized algorithms, and theoretical computer science. Among her research contributions are the asymptotic enumeration and generation of graphs that model real-world networks, the use of ideas from statistical physics to determine the satisfiability threshold of random linear equations over finite fields, and the use of techniques from differential equations to analyze a randomized algorithm for load balancing. Jane's publication list can be viewed on her Google Scholar page.