8 citations · 39 across the 17 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
Enumeration of graphs with a heavy-tailed degree sequence
Pu Gao, Nicholas Wormald
In this paper, we asymptotically enumerate graphs with a given degree sequence d=(d_1,...,d_n) satisfying restrictions designed to permit heavy-tailed sequences in the sparse case…
math.CO2014★ 8 cited
Analysis of the parallel peeling algorithm: a short proof
Pu Gao
A recent paper by Jiang, Mitzenmacher and Thaler upper bounded the number of rounds needed in a parallel peeling algorithm applied to a random hypergraph whose edge density is belo…