Detecting Random Geometric Graphs with General Kernel
We study testing a random geometric graph with a fixed kernel against an Erd\H{o}s-R\'enyi graph with the same edge density. Under the null hypothesis, the graph has $n$ vertices and independent edges with probability $p$. Under the alternative hypothesis, latent points $X_1,\ldots,X_n$ are independent and uniform on $...