Lecturer
School of Mathematical Sciences
Monash University
Office: 457 (9 Rainforest Walk, Clayton Campus)
Phone: 61 03 9905 4413
Email: jane dot gao at monash dot edu
Research
Random graph theory, asymptotic graph enumeration, theoretical computer science, randomized algorithms and stochastic processes.
Discrete Mathematics Group @ Monash
Publications
Preprints
- Amin Coja-Oghlan and Pu Gao.
The rank of random matrices over finite fields.
[arxiv]
- Pu Gao and Catherine Greenhill.
Uniform generation of spanning regular subgraphs of a dense graph.
[arxiv]
- Peter Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller.
The satisfiability threshold for random linear equations.
[arxiv]
- P. Gao, R. Ramadurai, I. Wanless and N. Wormald.
Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs.
[arxiv]
- P. Gao, R. Ramadurai, I. Wanless and N. Wormald.
Full rainbow matchings in graphs and hypergraphs.
[arxiv]
- P. Gao.
Analysis of the parallel peeling algorithm: a short proof.
[arxiv]
Published or accepted
- P. Gao and N. Wormald.
Uniform generation of random graphs with power-law degree sequences.
[arxiv]
SODA 2018: 1741-1758 (Extended abstract).
- P. Gao.
The stripping process can be slow: part II.
[arxiv]
Siam Journal on Discrete Mathematics, accepted.
- P. Gao, X. Perez-Gimenez and C. M. Sato.
Arboricity and spanning-tree packing of random graphs. [arxiv]
Random Struct. Algorithms, accepted.
Extended abstract published in SODA 2014, 317-326. [conference version]
-
P. Gao and N. Wormald.
Uniform generation of random regular graphs. [arxiv]
Siam Journal of Computing, 46(4): 1395-1427.
Extended abstract published in Proc. FOCS 2015, 1218-1230. [conference version]
- P. Gao and M. Molloy.
Inside the clustering window for random linear equations.
[arxiv]
Random Struct. Algorithms52(2): 197-218 (2018)
- P. Gao and M. Molloy.
The stripping process can be slow: part I.
[arxiv]
Random Struct. Algorithms, accepted.
- P. Gao and C. M. Sato.
A transition of limiting distributions of large matchings in random graphs. [arxiv]
Journal of Combinatorial Theory, Series B, 116: 57-86, 2016.
- P. Gao.
On the geometric Ramsey numbers of trees. [arxiv]
Discrete Mathematics, 339(1): 375-381, 2016.
- P. Gao and N. Wormald.
Enumeration of graphs with a heavy-tailed degree sequence.
[arxiv]
Advances in Mathematics, 287: 412-450, 2016.
- J. Cibulka, P. Gao, M. Krcal, T. Valla and P. Valtr.
On the geometric Ramsey number of outerplanar graphs. [arxiv]
Discrete & Computational Geometry, 53(1): 64-79, 2015.
Extended abstract published in Eurocomb 2013, 171-176.
- P. Gao, N. C. Wormald.
Orientability thresholds of random hypergraphs. [arxiv]
Combinatorics, Probability & Computing 24(5): 774-824 (2015).
Extended abstract (titled: Load balancing and orientability thresholds of random hypergraphs) published in Proc. STOC 2010, 97-104. [conference version]
- P. Gao.
The first k-regular subgraph is large. [arxiv]
Combinatorics, Probability & Computing, 23(3): 412-433 (2014).
- P. Gao.
Sandwiching a densest subgraph by consecutive cores. [ pdf]
Random Struct. Algorithms, 47(2): 341-360, 2015.
- E. Ebrahimzade, F. Farczadi, P. Gao, A. Mehrabian, C. Sato, N. Wormald and J. Zung.
On the longest path and the diameter in random Apollonian networks. [arxiv]
Random Struct. Algorithms, 45(4): 703-725, 2014.
Extended abstract published in Electronic Notes in Discrete Mathematics, 43, 355-365. [conference version]
- P. Gao.
Uniform generation of d-factors in dense host graphs. [pdf]
Graphs Combin. 30 (2014), no. 3, 581-589.
- P. Gao.
Distributions of sparse spanning subgraphs in random graphs. [arxiv]
SIAM Journal on Discrete Mathematics, 27 (2013), no. 1, 386-401.
- P. Gao.
Distribution of the number of spanning regular subgraphs in random graphs. [pdf]
Random Struct. Algorithms 43 (2013), no. 3, 338-353.
- P. Gao, Y. Su and N. C. Wormald.
Induced subgraphs in sparse random graphs with given degree sequence [pdf]
European Journal of Combinatorics, 33(6): 1142-1166 (2012).
- P. Gao.
The connectivity of the random regular graphs generated by the pegging algorithm [pdf]
J. Graph Theory, 65(3), 185-197, 2010.
- P. Gao, N. C. Wormald.
Rate of convergence of the short cycle distribution in random regular graphs generated by pegging. [pdf]
Elec. J. Combinatorics, Volumn 16(1)(2009), R44, 17 pp.
- P. Gao, N. C. Wormald.
Short cycle distributions in random regular graphs recursively generated by pegging. [pdf]
Random Struct. Algorithms 34(1): 54-86 (2009).
Theses