معرفی
Jane (Pu) Gao is an Assistant Professor in the Department of Combinatorics and Optimization at the University of Waterloo. Her research focuses on random graph theory, asymptotic graph enumeration, theoretical computer science, randomized algorithms, and stochastic processes. She has contributed to understanding sparse random graph structures, matroid evolution, and algorithmic processes in semi-random graph models. Her work often intersects probability, combinatorics, and discrete mathematics.
Education:
- PhD in Combinatorics and Optimization, University of Waterloo (2009)
- Master's essay in Mathematics, University of Waterloo (2006)
Research Trends: Her recent publications emphasize Hamiltonian cycle construction in semi-random processes, embedding theorems for random graphs, and the analysis of random regular graphs. These studies highlight applications in algorithm design, stochastic modeling, and structural graph theory.
Grants & Collaboration: Collaborates widely with researchers like A. Frieze, N. Wormald, and P. Pralat on projects involving random graphs, matroids, and combinatorial optimization. No specific grants are listed here.
Labs/Teams: While no specific lab is mentioned, her work is collaborative, leveraging interdisciplinary approaches within the Combinatorics and Optimization department.
