8 citations · 9 across the 2 of their papers we have counts for
2 papers
math.CO2013★ 8 cited
On the Longest Paths and the Diameter in Random Apollonian Networks
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao +4
We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at ran…
math.CO2010★ 1 cited
Induced subgraphs in sparse random graphs with given degree sequence
Pu Gao, Yi Su, Nicholas Wormald
For any , we compute the probability that the subgraph of induced by is a given graph on the vertex set . The result holds for any $d=o…