Research Report RR-16-315, March 16, 2016
We devise statistical tests to detect the presence of an embedded Erdos-Renyi (ER) subgraph inside a random graph, which is also an ER graph. We make use of properties of the asymptotic distribution of eigenvectors of random graphs to detect the subgraph. This problem is related to the planted clique problem that is of considerable interest.
Systèmes de Communication
© EURECOM. Personal use of this material is permitted. The definitive version of this paper was published in Research Report RR-16-315, March 16, 2016 and is available at :