Characterization of L1-norm Statistic for Anomaly Detection in Erdos Renyi Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

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

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.
Fichier principal
Vignette du fichier
root.pdf (346.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01403048 , version 1 (25-11-2016)

Identifiers

  • HAL Id : hal-01403048 , version 1

Cite

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⟩
142 View
248 Download

Share

Gmail Facebook Twitter LinkedIn More