Network Detection Theory and Performance
Steven T. Smith, Kenneth D. Senne, Scott Philips, Edward K. Kao, and, Garrett Bernstein

TL;DR
This paper introduces a Bayesian network detection framework called space-time threat propagation, which maximizes detection probability and is compared to spectral methods using a new stochastic model for covert networks.
Contribution
A novel Bayesian framework for network detection is proposed, leveraging prior info and observations, and proven to be optimal in the Neyman-Pearson sense.
Findings
Space-time threat propagation maximizes detection probability.
Spectral methods are compared with the new Bayesian approach.
Detection performance is analyzed using a new stochastic model.
Abstract
Network detection is an important capability in many areas of applied research in which data can be represented as a graph of entities and relationships. Oftentimes the object of interest is a relatively small subgraph in an enormous, potentially uninteresting background. This aspect characterizes network detection as a "big data" problem. Graph partitioning and network discovery have been major research areas over the last ten years, driven by interest in internet search, cyber security, social networks, and criminal or terrorist activities. The specific problem of network discovery is addressed as a special case of graph partitioning in which membership in a small subgraph of interest must be determined. Algebraic graph theory is used as the basis to analyze and compare different network detection methods. A new Bayesian network detection framework is introduced that partitions the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
