10 citations · 39 across the 21 of their papers we have counts for
4 papers · 1 filter
Triangles and subgraph probabilities in random regular graphs
Pu Gao
We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved results, we further improve the limiting distribution of the number of triangle…
Hamilton Cycles in the Semi-random Graph Process
Pu Gao, Bogumil Kaminski, Calum MacRury +1
The semi-random graph process is a single player game in which the player is initially presented an empty graph on vertices. In each round, a vertex is presented to the pla…
The threshold of symmetry in random graphs with specified degree sequences
Lochlan Brick, Pu Gao, Angus Southwell
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation…
Mixing time of the switch Markov chain and stable degree sequences
Pu Gao, Catherine Greenhill
The switch chain is a well-studied Markov chain which can be used to sample approximately uniformly from the set of all graphs with a given degree sequence $\bo…