Publications

Search
Author Title Type [ Year(Desc)]
2015
Gao, Pu , and Nicholas Wormald. 2015. “Orientability Thresholds For Random Hypergraphs”. Combinatorics, Probability And Computing 24: 774–824.
2016
Gao, Pu , and Nicholas Wormald. 2016. “Enumeration Of Graphs With A Heavy-Tailed Degree Sequence”. Advances In Mathematics 287: 412–450.
Gao, Pu . 2016. “On The Geometric Ramsey Numbers Of Trees”. Discrete Mathematics 339: 375–381.
Gao, Pu , and Cristiane M Sato. 2016. “A Transition Of Limiting Distributions Of Large Matchings In Random Graphs”. Journal Of Combinatorial Theory, Series B 116: 57–86.
2017
Gao, Pu , Reshma Ramadurai, Ian M Wanless, and Nick Wormald. 2017. “Counterexamples On Matchings In Hypergraphs And Full Rainbow Matchings In Graphs”. Arxiv Preprint Arxiv:1710.04807.
Ayre, Peter , Amin Coja-Oghlan, Pu Gao, and Noëla Müller. 2017. “The Satisfiability Threshold For Random Linear Equations”. Arxiv Preprint Arxiv:1710.07497.
Gao, Pu , Reshma Ramadurai, Ian Wanless, and Nick Wormald. 2017. “Full Rainbow Matchings In Graphs And Hypergraphs”. Arxiv Preprint Arxiv:1709.02665.
Gao, Pu , and Nicholas Wormald. 2017. “Uniform Generation Of Random Regular Graphs”. Siam Journal On Computing 46: 1395–1427.
2018
Gao, Pu , Remco van der Hofstad, Angus Southwell, and Clara Stegehuis. 2018. “Counting Triangles In Power-Law Uniform Random Graphs”. Arxiv Preprint Arxiv:1812.04289.
Coja-Oghlan, Amin , and Pu Gao. 2018. “The Rank Of Random Matrices Over Finite Fields”. Arxiv Preprint Arxiv:1810.07390.
Gao, Pu , and Catherine Greenhill. 2018. “Uniform Generation Of Spanning Regular Subgraphs Of A Dense Graph”. Arxiv Preprint Arxiv:1807.00964.
Gao, Pu , and Michael Molloy. 2018. “Inside The Clustering Window For Random Linear Equations”. Random Structures & Algorithms 52: 197–218.
Gao, Pu , and Michael Molloy. 2018. “The Stripping Process Can Be Slow: Part I”. Random Structures & Algorithms 53: 76–139.
Gao, Pu . 2018. “The Stripping Process Can Be Slow: Part Ii”. Siam Journal On Discrete Mathematics 32: 1159–1188.
Gao, Pu , and Nicholas Wormald. 2018. “Uniform Generation Of Random Graphs With Power-Law Degree Sequences”. In Proceedings Of The Twenty-Ninth Annual Acm-Siam Symposium On Discrete Algorithms, 1741–1758. Society for Industrial and Applied Mathematics.
2019
Arman, Andrii , Pu Gao, and Nicholas Wormald. 2019. “Fast Uniform Generation Of Random Graphs With Given Degree Sequences”. Arxiv Preprint Arxiv:1905.03446.
Gao, Pu , Mikhail Isaev, and Brendan McKay. 2019. “Sandwiching Random Regular Graphs Between Binomial Random Graphs”. Arxiv Preprint Arxiv:1906.02886.

Pages