Jane (Pu) Gao

Jane Gao

    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

  1. Peter Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller.  
    The satisfiability threshold for random linear equations.
      [arxiv]

  2. P. Gao, R. Ramadurai, I. Wanless and N. Wormald.  
    Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs.
      [arxiv]

  3. P. Gao, R. Ramadurai, I. Wanless and N. Wormald.  
    Full rainbow matchings in graphs and hypergraphs.
      [arxiv]

  4. P. Gao and N. Wormald.  
    Uniform generation of random graphs with power-law degree sequences.
      [arxiv]
         Extended abstract accepted by SODA 2018.

  5. P. Gao.  
    The stripping process can be slow: part II.
      [arxiv]

  6. P. Gao.  
    Analysis of the parallel peeling algorithm: a short proof.
      [arxiv]

Published or accepted

  1. 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]

  2. 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]

  3. P. Gao and M. Molloy.  
    Inside the clustering window for random linear equations.
      [arxiv]
        Random Struct. Algorithms, accepted.

  4. P. Gao and M. Molloy.  
    The stripping process can be slow: part I.
      [arxiv]
        Random Struct. Algorithms, accepted.

  5. 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.

  6. P. Gao.  
    On the geometric Ramsey numbers of trees.
       [arxiv]
        Discrete Mathematics, 339(1): 375-381, 2016.

  7. P. Gao and N. Wormald.  
    Enumeration of graphs with a heavy-tailed degree sequence.
      [arxiv]
        Advances in Mathematics, 287: 412-450, 2016.

  8. 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.

  9. 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]

  10. P. Gao.  
    The first k-regular subgraph is large.
       [arxiv]
        Combinatorics, Probability & Computing, 23(3): 412-433 (2014).

  11. P. Gao.   
    Sandwiching a densest subgraph by consecutive cores.
       [ pdf]
         Random Struct. Algorithms, 47(2): 341-360, 2015.

  12. 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]

  13. P. Gao.  
    Uniform generation of d-factors in dense host graphs.
       [pdf]
        Graphs Combin. 30 (2014), no. 3, 581-589.

  14. P. Gao.  
    Distributions of sparse spanning subgraphs in random graphs.
       [arxiv]
        SIAM Journal on Discrete Mathematics, 27 (2013), no. 1, 386-401.

  15. P. Gao.  
    Distribution of the number of spanning regular subgraphs in random graphs.
       [pdf]
        Random Struct. Algorithms 43 (2013), no. 3, 338-353.

  16. 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).

  17. P. Gao.  
    The connectivity of the random regular graphs generated by the pegging algorithm
       [pdf]
         J. Graph Theory, 65(3), 185-197, 2010.

  18. 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.

  19. 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