10 citations · 39 across the 21 of their papers we have counts for
24 papers
Minors of matroids represented by sparse random matrices over finite fields
Pu Gao, Peter Nelson
Consider a random matrix over the finite field of order where every column has precisely nonzero elements, and let be the matroid represented by .…
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process
Pu Gao, Calum MacRury, Pawel Pralat
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…
Multi-Band Wi-Fi Sensing with Matched Feature Granularity
Jianyuan Yu, Pu, Wang +4
Complementary to the fine-grained channel state information (CSI) from the physical layer and coarse-grained received signal strength indicator (RSSI) measurements, the mid-grained…
Perfect Matchings in the Semi-random Graph Process
Pu Gao, Calum MacRury, Pawel Pralat
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…
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…