3 citations · 5 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2022
On the clique number of noisy random geometric graphs
Matthew Kahle, Minghao Tian, Yusu Wang
Let be a random geometric graph, and then for we construct a "-perturbed noisy random geometric graph" where each existing edge in is…
math.CO2019
A limit theorem for the st Betti number of layer- subgraphs in random graphs
Minghao Tian, Yusu Wang
We initiate the study of local topology of random graphs. The high level goal is to characterize local "motifs" in graphs. In this paper, we consider what we call the layer- sub…