Pu Gao

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 43

Top Topics

Frequent Subgraph Mining

Learning Curves

Top Venues

Random Struct. Algorithms

SIAM J. Discret. Math.

Publications

Pu Gao
Triangles and Subgraph Probabilities in Random Regular Graphs. Electron. J. Comb. 31 (1) (2024)
Amin Coja-Oghlan, Alperen Ali Ergür, Pu Gao, Samuel Hetterich, Maurice Rolvien
The rank of sparse random matrices. Random Struct. Algorithms 62 (1) (2023)
Pu Gao, Yuval Ohapkin
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity. Random Struct. Algorithms 62 (4) (2023)
Alan M. Frieze, Pu Gao, Calum MacRury, Pawel Pralat, Gregory B. Sorkin
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds. CoRR (2023)
Lochlan Brick, Pu Gao, Angus Southwell
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences. SIAM J. Discret. Math. 37 (1) (2023)
Pu Gao
The number of perfect matchings, and the nesting properties, of random regular graphs. Random Struct. Algorithms 62 (4) (2023)
Pu Gao, Calum MacRury, Pawel Pralat
Perfect Matchings in the Semirandom Graph Process. SIAM J. Discret. Math. 36 (2) (2022)
Pu Gao, Calum MacRury, Pawel Pralat
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. CoRR (2022)
Pu Gao, Calum MacRury, Pawel Pralat
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. APPROX/RANDOM (2022)
Pu Gao, Bogumil Kaminski, Calum MacRury, Pawel Pralat
Hamilton cycles in the semi-random graph process. Eur. J. Comb. 99 (2022)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Fast uniform generation of random graphs with given degree sequences. Random Struct. Algorithms 59 (3) (2021)
Yuanxun Zheng, Zhanlin Cao, Pan Guo, Pu Gao, Peng Zhang
Fatigue Performance of Steel-Concrete Composite Continuous Box Girder Bridge Deck. Complex. 2021 (2021)
Amin Coja-Oghlan, Pu Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien
The full rank condition for sparse random matrices. CoRR (2021)
Pu Gao, Reshma Ramadurai, Ian M. Wanless, Nick Wormald
Full rainbow matchings in graphs and hypergraphs. Comb. Probab. Comput. 30 (5) (2021)
Pu Gao, Catherine S. Greenhill
Mixing time of the switch Markov chain and stable degree sequences. Discret. Appl. Math. 291 (2021)
Pu Gao, Calum MacRury, Pawel Pralat
Perfect Matchings in the Semi-random Graph Process. CoRR (2021)
Michael Anastos, Alan M. Frieze, Pu Gao
Hamiltonicity of Random Graphs in the Stochastic Block Model. SIAM J. Discret. Math. 35 (3) (2021)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Linear-time uniform generation of random sparse contingency tables with specified marginals. CoRR (2021)
Amin Coja-Oghlan, Alperen Ali Ergür, Pu Gao, Samuel Hetterich, Maurice Rolvien
The rank of sparse random matrices. SODA (2020)
Peter J. Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller
The Satisfiability Threshold For Random Linear Equations. Comb. 40 (2) (2020)
Pu Gao, Remco van der Hofstad, Angus Southwell, Clara Stegehuis
Counting Triangles in Power-Law Uniform Random Graphs. Electron. J. Comb. 27 (3) (2020)
Pu Gao, Mikhail Isaev, Brendan D. McKay
Sandwiching random regular graphs between binomial random graphs. SODA (2020)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Fast Uniform Generation of Random Graphs with Given Degree Sequences. FOCS (2019)
Andrii Arman, Pu Gao, Nicholas C. Wormald
Fast uniform generation of random graphs with given degree sequences. CoRR (2019)
Pu Gao, Catherine S. Greenhill
Uniform Generation of Spanning Regular Subgraphs of a Dense Graph. Electron. J. Comb. 26 (4) (2019)
Amin Coja-Oghlan, Pu Gao
The rank of random matrices over finite fields. CoRR (2018)
Pu Gao, Catherine S. Greenhill
Uniform generation of spanning regular subgraphs of a dense graph. CoRR (2018)
Pu Gao
The Stripping Process Can be Slow: Part II. SIAM J. Discret. Math. 32 (2) (2018)
Pu Gao, Michael Molloy
The stripping process can be slow: Part I. Random Struct. Algorithms 53 (1) (2018)
Pu Gao, Nicholas C. Wormald
Uniform generation of random graphs with power-law degree sequences. SODA (2018)
Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato
Arboricity and spanning-tree packing in random graphs. Random Struct. Algorithms 52 (3) (2018)
Pu Gao, Michael Molloy
Inside the clustering window for random linear equations. Random Struct. Algorithms 52 (2) (2018)
Pu Gao, Nicholas C. Wormald
Uniform Generation of Random Regular Graphs. SIAM J. Comput. 46 (4) (2017)
Pu Gao, Nicholas C. Wormald
Uniform generation of random graphs with power-law degree sequences. CoRR (2017)
Peter J. Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller
The satisfiability threshold for random linear equations. CoRR (2017)
Pu Gao
On the geometric Ramsey numbers of trees. Discret. Math. 339 (1) (2016)
Pu Gao, Cristiane M. Sato
A transition of limiting distributions of large matchings in random graphs. J. Comb. Theory, Ser. B 116 (2016)
Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr
On the Geometric Ramsey Number of Outerplanar Graphs. Discret. Comput. Geom. 53 (1) (2015)
Pu Gao, Nicholas C. Wormald
Orientability Thresholds for Random Hypergraphs. Comb. Probab. Comput. 24 (5) (2015)
Pu Gao, Nicholas C. Wormald
Uniform Generation of Random Regular Graphs. FOCS (2015)
Pu Gao
Sandwiching a densest subgraph by consecutive cores. Random Struct. Algorithms 47 (2) (2015)
Pu Gao, Michael Molloy
Inside the clustering window for random linear equations. CoRR (2015)
Pu Gao, Nicholas C. Wormald
Uniform generation of random regular graphs. CoRR (2015)
Pu Gao
Uniform Generation of d-Factors in Dense Host Graphs. Graphs Comb. 30 (3) (2014)
Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato
Arboricity and spanning-tree packing in random graphs with an application to load balancing. SODA (2014)
Pu Gao
-Regular Subgraph is Large. Comb. Probab. Comput. 23 (3) (2014)
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung
On longest paths and diameter in random apollonian network. Random Struct. Algorithms 45 (4) (2014)
Pu Gao
Distributions of Sparse Spanning Subgraphs in Random Graphs. SIAM J. Discret. Math. 27 (1) (2013)
Pu Gao, Michael Molloy
Inside the clustering threshold for random linear equations. CoRR (2013)
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung
On the Longest Paths and the Diameter in Random Apollonian Networks. Electron. Notes Discret. Math. 43 (2013)
Pu Gao
Distribution of the number of spanning regular subgraphs in random graphs. Random Struct. Algorithms 43 (3) (2013)
Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr
On the Geometric Ramsey Number of Outerplanar Graphs. CoRR (2013)
Pu Gao, Yi Su, Nicholas C. Wormald
Induced subgraphs in sparse random graphs with given degree sequences. Eur. J. Comb. 33 (6) (2012)
Pu Gao, Hong P. Liu, David P. Gluch
On Modelling, Simulating and Verifying a Decentralized Mission Control Algorithm for a Fleet of Collaborative UAVs. ICCS (2012)
Pu Gao, Nicholas C. Wormald
Orientability thresholds for random hypergraphs CoRR (2010)
Pu Gao, Nicholas C. Wormald
Load balancing and orientability thresholds for random hypergraphs. STOC (2010)
Pu Gao
Connectivity of random regular graphs generated by the pegging algorithm. J. Graph Theory 65 (3) (2010)
Pu Gao, Nicholas C. Wormald
Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging. Electron. J. Comb. 16 (1) (2009)
Pu Gao, Nicholas C. Wormald
Short cycle distribution in random regular graphs recursively generated by pegging. Random Struct. Algorithms 34 (1) (2009)