Graduate School and Research Center in Digital Sciences

Characterization of L1-norm statistic for anomaly detection in Erdos Renyi graphs

Kadavankandy, Arun; Cottatellucci, Laura; Avrachenkov, Konstantin

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.

Document Bibtex

Title:Characterization of L1-norm statistic for anomaly detection in Erdos Renyi graphs
Keywords:Subgraph detection, Erdos-Renyi, Detection and Estimation
Type:Report
Language:English
City:
Date:
Department:Communication systems
Eurecom ref:4852
Copyright: © 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 :
Bibtex: @techreport{EURECOM+4852, year = {2016}, title = {{C}haracterization of {L}1-norm statistic for anomaly detection in {E}rdos {R}enyi graphs}, author = {{K}adavankandy, {A}run and {C}ottatellucci, {L}aura and {A}vrachenkov, {K}onstantin }, number = {EURECOM+4852}, month = {03}, institution = {Eurecom}, url = {http://www.eurecom.fr/publication/4852},, }
See also: