TY - JOUR

T1 - Reshaping terrorist networks

AU - Spezzano, Francesca

AU - Subrahmanian, V. S.

AU - Mannes, Aaron

PY - 2014/8

Y1 - 2014/8

N2 - The STONE algorithms identify a set of operatives whose removal would maximally reduce lethality to destabilize terrorist organizations. STONE uses three novel algorithms, Terrorist Successor Problem (TSP), Multiple Terrorist Successor Problem (MTSP), and Terrorist Network Reshaping Problem (TNRP). Measuring lethality of terrorist networks, STONE algorithms help predict who will succeed a removed terrorist leader with over 80% accuracy. STONE develops a mathematical model of who replaces a removed individual in a terrorist network, taking into account both network structure and vertex properties, as well as the need for the terrorist network to achieve operational effectiveness. A terrorist organization network (ON) is an undirected graph with vertices and edges. Each vertex is labeled with some properties drawn from a set VP of properties. STONE allows an analyst to specify any set of properties a vertex should have in order to be an appropriate replacement node for a vertex that is being removed.

AB - The STONE algorithms identify a set of operatives whose removal would maximally reduce lethality to destabilize terrorist organizations. STONE uses three novel algorithms, Terrorist Successor Problem (TSP), Multiple Terrorist Successor Problem (MTSP), and Terrorist Network Reshaping Problem (TNRP). Measuring lethality of terrorist networks, STONE algorithms help predict who will succeed a removed terrorist leader with over 80% accuracy. STONE develops a mathematical model of who replaces a removed individual in a terrorist network, taking into account both network structure and vertex properties, as well as the need for the terrorist network to achieve operational effectiveness. A terrorist organization network (ON) is an undirected graph with vertices and edges. Each vertex is labeled with some properties drawn from a set VP of properties. STONE allows an analyst to specify any set of properties a vertex should have in order to be an appropriate replacement node for a vertex that is being removed.

UR - http://www.scopus.com/inward/record.url?scp=84905251002&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84905251002&partnerID=8YFLogxK

U2 - 10.1145/2632661.2632664

DO - 10.1145/2632661.2632664

M3 - Article

AN - SCOPUS:84905251002

SN - 0001-0782

VL - 57

SP - 60

EP - 69

JO - Communications of the ACM

JF - Communications of the ACM

IS - 8

ER -