Abstract : 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.
https://hal.inria.fr/hal-01403048 Contributor : Konstantin AvrachenkovConnect in order to contact the contributor Submitted on : Friday, November 25, 2016 - 5:10:19 PM Last modification on : Monday, March 29, 2021 - 2:47:23 PM Long-term archiving on: : Tuesday, March 21, 2017 - 11:24:55 AM
Arun Kadavankandy, Laura Cottatellucci, Konstantin Avrachenkov. Characterization of L1-norm Statistic for Anomaly Detection in Erdos Renyi Graphs. IEEE CDC 2016, Dec 2016, Las Vegas, United States. ⟨hal-01403048⟩