Gao Pu

activity

20102026

most citedAnalysis of the parallel peeling algorithm: a short proof

8 citations · 39 across the 17 of their papers we have counts for

collaborators

Showing 2021 · math.COShow all

2 papers · 2 filters

math.CO2021★ 1 cited

The number of perfect matchings, and the nesting properties, of random regular graphs

Pu Gao

We prove that the number of perfect matchings in $G (n, d)$ is asymptotically normal when $n$ is even, $d \to \infty$ as $n \to \infty$ , and $d = O (n^{1/7} / lo g^{2} n)$ . This is t…

math.CO2021

Linear-time uniform generation of random sparse contingency tables with specified marginals

Andrii Arman, Pu Gao, Nicholas Wormald

We give an algorithm that generates a uniformly random contingency table with specified marginals, i.e. a matrix with non-negative integer values and specified row and column sums.…