Abstract:Let G n be a random geometric graph, and then for q, p β [0, 1) we construct a (q, p)-perturbed noisy random geometric graph G q,p n where each existing edge in G n is removed with probability q, while and each non-existent edge in G n is inserted with probability p. We give asymptotically tight bounds on the clique number π ( G q,p n) for several regimes of parameter.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citationsβcitations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.