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.
Origin : Files produced by the author(s)
Loading...