On the clique number of noisy random geometric graphs

Matthew Kahle, Minghao Tian, Yusu Wang

Let $G_n$ be a random geometric graph, and then for $q,p\in [0,1)$ we construct a "$(q,p)$-perturbed noisy random geometric graph" $G_n^{q,p}$ where each existing edge in $G_n$ is…