Screening Heuristics for the Evaluation of Covert Network Node Insertion Scenarios

The majority of research on covert networks uses social network analysis (SNA) to determine critical members of the network to either kill or capture for the purpose of network destabilization. This thesis takes the opposite approach and evaluates potential scenarios for inserting an agent into a covert network for information gathering purposes or future disruption operations. Due to the substantial number of potential insertion scenarios in a large network, this research proposes three screening heuristics that leverage SNA measures to reduce the solution space before applying a simple search heuristic.