On Heterogeneous Covert Networks

R. Lindelauf, P.E.M. Borm, H.J.M. Hamers

Research output: Working paperDiscussion paperOther research output

349 Downloads (Pure)

Abstract

Covert organizations are constantly faced with a tradeoff between secrecy and operational efficiency. Lindelauf, Borm and Hamers (2008) developed a theoretical framework to deter- mine optimal homogeneous networks taking the above mentioned considerations explicitly into account. In this paper this framework is put to the test by applying it to the 2002 Jemaah Islamiyah Bali bombing. It is found that most aspects of this covert network can be explained by the theoretical framework. Some interactions however provide a higher risk to the network than others. The theoretical framework on covert networks is extended to accommodate for such heterogeneous interactions. Given a network structure the optimal location of one risky interaction is established. It is shown that the pair of individuals in the organization that should conduct the interaction that presents the highest risk to the organization, is the pair that is the least connected to the remainder of the network. Furthermore, optimal networks given a single risky interaction are approximated and compared. When choosing among a path, star and ring graph it is found that for low order graphs the path graph is best. When increasing the order of graphs under consideration a transition occurs such that the star graph becomes best. It is found that the higher the risk a single interaction presents to the covert network the later this transition from path to star graph occurs.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages13
Volume2008-46
Publication statusPublished - 2008

Publication series

NameCentER Discussion Paper
Volume2008-46

Fingerprint

Heterogeneous networks
Stars
Bombing

Keywords

  • covert networks
  • terrorist networks
  • heterogeneity
  • game theory
  • information
  • secrecy

Cite this

Lindelauf, R., Borm, P. E. M., & Hamers, H. J. M. (2008). On Heterogeneous Covert Networks. (CentER Discussion Paper; Vol. 2008-46). Tilburg: Operations research.
Lindelauf, R. ; Borm, P.E.M. ; Hamers, H.J.M. / On Heterogeneous Covert Networks. Tilburg : Operations research, 2008. (CentER Discussion Paper).
@techreport{f3e01f8a65e04c0f95db290b941fbe9f,
title = "On Heterogeneous Covert Networks",
abstract = "Covert organizations are constantly faced with a tradeoff between secrecy and operational efficiency. Lindelauf, Borm and Hamers (2008) developed a theoretical framework to deter- mine optimal homogeneous networks taking the above mentioned considerations explicitly into account. In this paper this framework is put to the test by applying it to the 2002 Jemaah Islamiyah Bali bombing. It is found that most aspects of this covert network can be explained by the theoretical framework. Some interactions however provide a higher risk to the network than others. The theoretical framework on covert networks is extended to accommodate for such heterogeneous interactions. Given a network structure the optimal location of one risky interaction is established. It is shown that the pair of individuals in the organization that should conduct the interaction that presents the highest risk to the organization, is the pair that is the least connected to the remainder of the network. Furthermore, optimal networks given a single risky interaction are approximated and compared. When choosing among a path, star and ring graph it is found that for low order graphs the path graph is best. When increasing the order of graphs under consideration a transition occurs such that the star graph becomes best. It is found that the higher the risk a single interaction presents to the covert network the later this transition from path to star graph occurs.",
keywords = "covert networks, terrorist networks, heterogeneity, game theory, information, secrecy",
author = "R. Lindelauf and P.E.M. Borm and H.J.M. Hamers",
note = "Subsequently published in Mathematical Methods in Counterterrorism (book), 2009 Pagination: 13",
year = "2008",
language = "English",
volume = "2008-46",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Lindelauf, R, Borm, PEM & Hamers, HJM 2008 'On Heterogeneous Covert Networks' CentER Discussion Paper, vol. 2008-46, Operations research, Tilburg.

On Heterogeneous Covert Networks. / Lindelauf, R.; Borm, P.E.M.; Hamers, H.J.M.

Tilburg : Operations research, 2008. (CentER Discussion Paper; Vol. 2008-46).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - On Heterogeneous Covert Networks

AU - Lindelauf, R.

AU - Borm, P.E.M.

AU - Hamers, H.J.M.

N1 - Subsequently published in Mathematical Methods in Counterterrorism (book), 2009 Pagination: 13

PY - 2008

Y1 - 2008

N2 - Covert organizations are constantly faced with a tradeoff between secrecy and operational efficiency. Lindelauf, Borm and Hamers (2008) developed a theoretical framework to deter- mine optimal homogeneous networks taking the above mentioned considerations explicitly into account. In this paper this framework is put to the test by applying it to the 2002 Jemaah Islamiyah Bali bombing. It is found that most aspects of this covert network can be explained by the theoretical framework. Some interactions however provide a higher risk to the network than others. The theoretical framework on covert networks is extended to accommodate for such heterogeneous interactions. Given a network structure the optimal location of one risky interaction is established. It is shown that the pair of individuals in the organization that should conduct the interaction that presents the highest risk to the organization, is the pair that is the least connected to the remainder of the network. Furthermore, optimal networks given a single risky interaction are approximated and compared. When choosing among a path, star and ring graph it is found that for low order graphs the path graph is best. When increasing the order of graphs under consideration a transition occurs such that the star graph becomes best. It is found that the higher the risk a single interaction presents to the covert network the later this transition from path to star graph occurs.

AB - Covert organizations are constantly faced with a tradeoff between secrecy and operational efficiency. Lindelauf, Borm and Hamers (2008) developed a theoretical framework to deter- mine optimal homogeneous networks taking the above mentioned considerations explicitly into account. In this paper this framework is put to the test by applying it to the 2002 Jemaah Islamiyah Bali bombing. It is found that most aspects of this covert network can be explained by the theoretical framework. Some interactions however provide a higher risk to the network than others. The theoretical framework on covert networks is extended to accommodate for such heterogeneous interactions. Given a network structure the optimal location of one risky interaction is established. It is shown that the pair of individuals in the organization that should conduct the interaction that presents the highest risk to the organization, is the pair that is the least connected to the remainder of the network. Furthermore, optimal networks given a single risky interaction are approximated and compared. When choosing among a path, star and ring graph it is found that for low order graphs the path graph is best. When increasing the order of graphs under consideration a transition occurs such that the star graph becomes best. It is found that the higher the risk a single interaction presents to the covert network the later this transition from path to star graph occurs.

KW - covert networks

KW - terrorist networks

KW - heterogeneity

KW - game theory

KW - information

KW - secrecy

M3 - Discussion paper

VL - 2008-46

T3 - CentER Discussion Paper

BT - On Heterogeneous Covert Networks

PB - Operations research

CY - Tilburg

ER -

Lindelauf R, Borm PEM, Hamers HJM. On Heterogeneous Covert Networks. Tilburg: Operations research. 2008. (CentER Discussion Paper).