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
Contributeur : Konstantin Avrachenkov
<>
Soumis le : vendredi 25 novembre 2016 - 17:10:19
Dernière modification le : lundi 30 avril 2018 - 14:30:10
Document(s) archivé(s) le : mardi 21 mars 2017 - 11:24:55
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. 2016, Proceedings of IEEE CDC. 〈hal-01403048〉
