Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging. - Pu Gao; Nicholas C. Wormald (Electron. J. Comb., 2009)

Short cycle distribution in random regular graphs recursively generated by pegging. - Pu Gao; Nicholas C. Wormald (Random Struct. Algorithms, 2009)

Load balancing and orientability thresholds for random hypergraphs. - Pu Gao; Nicholas C. Wormald (STOC, 2010)

Connectivity of random regular graphs generated by the pegging algorithm. - Pu Gao (J. Graph Theory, 2010)

Induced subgraphs in sparse random graphs with given degree sequences. - Pu Gao; Yi Su; Nicholas C. Wormald (Eur. J. Comb., 2012)

On Modelling, Simulating and Verifying a Decentralized Mission Control Algorithm for a Fleet of Collaborative UAVs. - Pu Gao; Hong P. Liu; David P. Gluch (ICCS, 2012)

Inside the clustering threshold for random linear equations. - Pu Gao; Michael Molloy 001 (CoRR, 2013)

On the Longest Paths and the Diameter in Random Apollonian Networks. - Ehsan Ebrahimzadeh; Linda Farczadi; Pu Gao; Abbas Mehrabian; Cristiane M. Sato; Nick Wormald; Jonathan Zung (Electron. Notes Discret. Math., 2013)

Distribution of the number of spanning regular subgraphs in random graphs. - Pu Gao (Random Struct. Algorithms, 2013)

Distributions of Sparse Spanning Subgraphs in Random Graphs. - Pu Gao (SIAM J. Discret. Math., 2013)

Arboricity and spanning-tree packing in random graphs with an application to load balancing. - Pu Gao; Xavier Pérez-Giménez; Cristiane M. Sato (SODA, 2014)

The First k-Regular Subgraph is Large. - Pu Gao (Comb. Probab. Comput., 2014)

Uniform Generation of d-Factors in Dense Host Graphs. - Pu Gao (Graphs Comb., 2014)

On longest paths and diameter in random apollonian network. - Ehsan Ebrahimzadeh; Linda Farczadi; Pu Gao; Abbas Mehrabian; Cristiane M. Sato; Nick Wormald; Jonathan Zung (Random Struct. Algorithms, 2014)

Orientability Thresholds for Random Hypergraphs. - Pu Gao; Nicholas C. Wormald (Comb. Probab. Comput., 2015)

On the Geometric Ramsey Number of Outerplanar Graphs. - Josef Cibulka; Pu Gao; Marek Krcál; Tomás Valla; Pavel Valtr 001 (Discret. Comput. Geom., 2015)

Sandwiching a densest subgraph by consecutive cores. - Pu Gao (Random Struct. Algorithms, 2015)

On the geometric Ramsey numbers of trees. - Pu Gao (Discret. Math., 2016)

A transition of limiting distributions of large matchings in random graphs. - Pu Gao; Cristiane M. Sato (J. Comb. Theory B, 2016)

Uniform Generation of Random Regular Graphs. - Pu Gao; Nicholas C. Wormald (SIAM J. Comput., 2017)

Uniform generation of random graphs with power-law degree sequences. - Pu Gao; Nicholas C. Wormald (SODA, 2018)

The rank of random matrices over finite fields. - Amin Coja-Oghlan; Pu Gao (CoRR, 2018)

Inside the clustering window for random linear equations. - Pu Gao; Michael Molloy 001 (Random Struct. Algorithms, 2018)

The stripping process can be slow: Part I. - Pu Gao; Michael Molloy 001 (Random Struct. Algorithms, 2018)

Arboricity and spanning-tree packing in random graphs. - Pu Gao; Xavier Pérez-Giménez; Cristiane M. Sato (Random Struct. Algorithms, 2018)

The Stripping Process Can be Slow: Part II. - Pu Gao (SIAM J. Discret. Math., 2018)

Uniform Generation of Spanning Regular Subgraphs of a Dense Graph. - Pu Gao; Catherine S. Greenhill (Electron. J. Comb., 2019)

Sandwiching random regular graphs between binomial random graphs. - Pu Gao; Mikhail Isaev; Brendan D. McKay (SODA, 2020)

The Satisfiability Threshold For Random Linear Equations. - Peter J. Ayre; Amin Coja-Oghlan; Pu Gao; Noëla Müller (Comb., 2020)

Counting Triangles in Power-Law Uniform Random Graphs. - Pu Gao; Remco van der Hofstad; Angus Southwell; Clara Stegehuis (Electron. J. Comb., 2020)

Fatigue Performance of Steel-Concrete Composite Continuous Box Girder Bridge Deck. - Yuanxun Zheng; Zhanlin Cao; Pan Guo; Pu Gao; Peng Zhang (Complex., 2021)

Linear-time uniform generation of random sparse contingency tables with specified marginals. - Andrii Arman; Pu Gao; Nicholas C. Wormald (CoRR, 2021)

Perfect Matchings in the Semi-random Graph Process. - Pu Gao; Calum MacRury; Pawel Pralat (CoRR, 2021)

Full rainbow matchings in graphs and hypergraphs. - Pu Gao; Reshma Ramadurai; Ian M. Wanless; Nick Wormald (Comb. Probab. Comput., 2021)

Mixing time of the switch Markov chain and stable degree sequences. - Pu Gao; Catherine S. Greenhill (Discret. Appl. Math., 2021)

Fast uniform generation of random graphs with given degree sequences. - Andrii Arman; Pu Gao; Nicholas C. Wormald (Random Struct. Algorithms, 2021)

Hamiltonicity of Random Graphs in the Stochastic Block Model. - Michael Anastos; Alan M. Frieze; Pu Gao (SIAM J. Discret. Math., 2021)

A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. - Pu Gao; Calum MacRury; Pawel Pralat (APPROX/RANDOM, 2022)

Hamilton cycles in the semi-random graph process. - Pu Gao; Bogumil Kaminski; Calum MacRury; Pawel Pralat (Eur. J. Comb., 2022)

Perfect Matchings in the Semirandom Graph Process. - Pu Gao; Calum MacRury; Pawel Pralat (SIAM J. Discret. Math., 2022)

The rank of sparse random matrices. - Amin Coja-Oghlan; Alperen Ali Ergür; Pu Gao; Samuel Hetterich; Maurice Rolvien (Random Struct. Algorithms, 2023)

The Threshold of Symmetry in Random Graphs with Specified Degree Sequences. - Lochlan Brick; Pu Gao; Angus Southwell (SIAM J. Discret. Math., 2023)

The number of perfect matchings, and the nesting properties, of random regular graphs. - Pu Gao (Random Struct. Algorithms, 2023)

Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity. - Pu Gao; Yuval Ohapkin (Random Struct. Algorithms, 2023)

Triangles and Subgraph Probabilities in Random Regular Graphs. - Pu Gao (Electron. J. Comb., 2024)

The full rank condition for sparse random matrices. - Amin Coja-Oghlan; Pu Gao; Max Hahn-Klimroth; Joon Lee; Noëla Müller; Maurice Rolvien (Comb. Probab. Comput., 2024)

Embedding theorems for random graphs with specified degrees. - Pu Gao; Yuval Ohapkin (Comb. Probab. Comput., 2025)

Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds. - Alan M. Frieze; Pu Gao; Calum MacRury; Pawel Pralat; Gregory B. Sorkin (Eur. J. Comb., 2025)

On the Pre- and Post-Positional Semi-Random Graph Processes. - Pu Gao; Hidde Koerts (J. Graph Theory, 2025)

Towards Emotionally Consistent Text-Based Speech Editing: Introducing EmoCorrector and The ECD-TSE Dataset. - Rui Liu 008; Pu Gao; Jiatian Xi; Berrak Sisman; Carlos Busso; Haizhou Li 001 (CoRR, 2025)