Skip to Main content Skip to Navigation
Conference papers

Characterization of L1-norm Statistic for Anomaly Detection in Erdos Renyi Graphs

Arun Kadavankandy 1 Laura Cottatellucci 2 Konstantin Avrachenkov 1
1 MAESTRO - Models for the performance analysis and the control of networks
CRISAM - Inria Sophia Antipolis - Méditerranée
2 Eurecom [Sophia Antipolis]
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.
Keywords : Subgraph detection Erdos-Renyi random graph Network hypothesis testing
Document type :
Conference papers
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
https://hal.inria.fr/hal-01403048
Contributor : Konstantin Avrachenkov <>
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

File

Vignette du document
root.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01403048, version 1

Collections

INRIA | EURECOM

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

374

Files downloads

430

 

Contact                    Legal Notice                    Personal Data