<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1d3 20150301//EN" "http://jats.nlm.nih.gov/publishing/1.1d3/JATS-journalpublishing1.dtd">
<article article-type="research-article" dtd-version="1.1d3" xml:lang="en" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="nlm-ta">PLoS ONE</journal-id>
<journal-id journal-id-type="publisher-id">plos</journal-id>
<journal-id journal-id-type="pmc">plosone</journal-id>
<journal-title-group>
<journal-title>PLOS ONE</journal-title>
</journal-title-group>
<issn pub-type="epub">1932-6203</issn>
<publisher>
<publisher-name>Public Library of Science</publisher-name>
<publisher-loc>San Francisco, CA USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.1371/journal.pone.0238019</article-id>
<article-id pub-id-type="publisher-id">PONE-D-19-27745</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Research Article</subject>
</subj-group>
<subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Economics</subject><subj-group><subject>Commerce</subject><subj-group><subject>Vendors</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Research and analysis methods</subject><subj-group><subject>Simulation and modeling</subject><subj-group><subject>Agent-based modeling</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Computer and information sciences</subject><subj-group><subject>Systems science</subject><subj-group><subject>Agent-based modeling</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Physical sciences</subject><subj-group><subject>Mathematics</subject><subj-group><subject>Systems science</subject><subj-group><subject>Agent-based modeling</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Computer and information sciences</subject><subj-group><subject>Network analysis</subject><subj-group><subject>Centrality</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Computer and information sciences</subject><subj-group><subject>Network analysis</subject><subj-group><subject>Signaling networks</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Computer and information sciences</subject><subj-group><subject>Network analysis</subject></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Computer and information sciences</subject><subj-group><subject>Network analysis</subject><subj-group><subject>Social networks</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Sociology</subject><subj-group><subject>Social networks</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Sociology</subject><subj-group><subject>Criminology</subject><subj-group><subject>Crime</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Medicine and health sciences</subject><subj-group><subject>Epidemiology</subject><subj-group><subject>Medical risk factors</subject><subj-group><subject>Traumatic injury risk factors</subject><subj-group><subject>Violent crime</subject></subj-group></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Medicine and health sciences</subject><subj-group><subject>Public and occupational health</subject><subj-group><subject>Traumatic injury risk factors</subject><subj-group><subject>Violent crime</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Sociology</subject><subj-group><subject>Criminology</subject><subj-group><subject>Crime</subject><subj-group><subject>Violent crime</subject></subj-group></subj-group></subj-group></subj-group></subj-group></article-categories>
<title-group>
<article-title>The responsiveness of criminal networks to intentional attacks: Disrupting darknet drug trade</article-title>
<alt-title alt-title-type="running-head">Criminal network responsiveness</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes" xlink:type="simple">
<contrib-id authenticated="true" contrib-id-type="orcid">http://orcid.org/0000-0002-2071-8357</contrib-id>
<name name-style="western">
<surname>Duxbury</surname>
<given-names>Scott</given-names>
</name>
<role content-type="https://casrai.org/credit/">Conceptualization</role>
<role content-type="https://casrai.org/credit/">Data curation</role>
<role content-type="https://casrai.org/credit/">Formal analysis</role>
<role content-type="https://casrai.org/credit/">Funding acquisition</role>
<role content-type="https://casrai.org/credit/">Investigation</role>
<role content-type="https://casrai.org/credit/">Methodology</role>
<role content-type="https://casrai.org/credit/">Project administration</role>
<role content-type="https://casrai.org/credit/">Software</role>
<role content-type="https://casrai.org/credit/">Supervision</role>
<role content-type="https://casrai.org/credit/">Validation</role>
<role content-type="https://casrai.org/credit/">Visualization</role>
<role content-type="https://casrai.org/credit/">Writing – original draft</role>
<role content-type="https://casrai.org/credit/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff001"><sup>1</sup></xref>
<xref ref-type="corresp" rid="cor001">*</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple">
<name name-style="western">
<surname>Haynie</surname>
<given-names>Dana L.</given-names>
</name>
<role content-type="https://casrai.org/credit/">Conceptualization</role>
<role content-type="https://casrai.org/credit/">Funding acquisition</role>
<role content-type="https://casrai.org/credit/">Supervision</role>
<role content-type="https://casrai.org/credit/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff002"><sup>2</sup></xref>
</contrib>
</contrib-group>
<aff id="aff001"><label>1</label> <addr-line>Department of Sociology, University of North Carolina, Chapel Hill, North Carolina, United States of America</addr-line></aff>
<aff id="aff002"><label>2</label> <addr-line>Department of Sociology, The Ohio State University, Columbus, Ohio, United States of America</addr-line></aff>
<contrib-group>
<contrib contrib-type="editor" xlink:type="simple">
<name name-style="western">
<surname>Karsai</surname>
<given-names>Marton</given-names>
</name>
<role>Editor</role>
<xref ref-type="aff" rid="edit1"/>
</contrib>
</contrib-group>
<aff id="edit1"><addr-line>Central European University, HUNGARY</addr-line></aff>
<author-notes>
<fn fn-type="conflict" id="coi001">
<p>The authors have declared that no competing interests exist.</p>
</fn>
<corresp id="cor001">* E-mail: <email xlink:type="simple">duxbury@email.unc.edu</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>10</day>
<month>9</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="collection">
<year>2020</year>
</pub-date>
<volume>15</volume>
<issue>9</issue>
<elocation-id>e0238019</elocation-id>
<history>
<date date-type="received">
<day>20</day>
<month>11</month>
<year>2019</year>
</date>
<date date-type="accepted">
<day>11</day>
<month>5</month>
<year>2020</year>
</date>
</history>
<permissions>
<copyright-year>2020</copyright-year>
<copyright-holder>Duxbury, Haynie</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">
<license-p>This is an open access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">Creative Commons Attribution License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="info:doi/10.1371/journal.pone.0238019"/>
<abstract>
<p>Physical, technological, and social networks are often at risk of intentional attack. Despite the wide-spanning importance of network vulnerability, very little is known about how criminal networks respond to attacks or whether intentional attacks affect criminal activity in the long-run. To assess criminal network responsiveness, we designed an empirically-grounded agent-based simulation using population-level network data on 16,847 illicit drug exchanges between 7,295 users of an active darknet drug market and statistical methods for simulation analysis. We consider three attack strategies: targeted attacks that delete structurally integral vertices, weak link attacks that delete large numbers of weakly connected vertices, and signal attacks that saturate the network with noisy signals. Results reveal that, while targeted attacks are effective when conducted at a large-scale, weak link and signal attacks deter more potential drug transactions and buyers when only a small portion of the network is attacked. We also find that intentional attacks affect network behavior. When networks are attacked, actors grow more cautious about forging ties, connecting less frequently and only to trustworthy alters. Operating in tandem, these two processes undermine long-term network robustness and increase network vulnerability to future attacks.</p>
</abstract>
<funding-group>
<award-group id="award001">
<funding-source>
<institution-wrap>
<institution-id institution-id-type="funder-id">http://dx.doi.org/10.13039/501100008982</institution-id>
<institution>National Science Foundation</institution>
</institution-wrap>
</funding-source>
<award-id>GRT00046370</award-id>
<principal-award-recipient>
<name name-style="western">
<surname>Haynie</surname>
<given-names>Dana L.</given-names>
</name>
</principal-award-recipient>
</award-group>
<funding-statement>The study is funded by the National Science Foundation, Grants: GRT00046370 and 1949037. PI: DLH. NSF website: <ext-link ext-link-type="uri" xlink:href="https://www.nsf.gov/funding/pgm_summ.jsp?pims_id=5369" xlink:type="simple">https://www.nsf.gov/funding/pgm_summ.jsp?pims_id=5369</ext-link>. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.</funding-statement>
</funding-group>
<counts>
<fig-count count="5"/>
<table-count count="1"/>
<page-count count="13"/>
</counts>
<custom-meta-group>
<custom-meta id="data-availability">
<meta-name>Data Availability</meta-name>
<meta-value>All relevant data are available via <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.7910/DVN/WXMWSL" xlink:type="simple">https://doi.org/10.7910/DVN/WXMWSL</ext-link>.</meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<sec id="sec001" sec-type="intro">
<title>Introduction</title>
<p>As human societies grow increasingly complex and interdependent, they become more reliant on technological, infrastructural, and social networks. This greater reliance on networks has resulted in growing concern about network vulnerability: a network’s ability to weather intentional attacks [<xref ref-type="bibr" rid="pone.0238019.ref001">1</xref>–<xref ref-type="bibr" rid="pone.0238019.ref015">15</xref>]. Network vulnerability has been the subject of much interdisciplinary inquiry and findings from this body of research have contributed to diverse areas of science. To physics, by providing analytic insight to the statistical mechanics of complex networks [<xref ref-type="bibr" rid="pone.0238019.ref001">1</xref>, <xref ref-type="bibr" rid="pone.0238019.ref007">7</xref>, <xref ref-type="bibr" rid="pone.0238019.ref011">11</xref>, <xref ref-type="bibr" rid="pone.0238019.ref015">15</xref>]. To medicine, by evaluating points of intervention to impede disease diffusion [<xref ref-type="bibr" rid="pone.0238019.ref016">16</xref>]. To biology, by assessing the resilience of animal herds to the loss of members [<xref ref-type="bibr" rid="pone.0238019.ref017">17</xref>]. And, to social science, by offering insight to group dynamics in unstable environments [<xref ref-type="bibr" rid="pone.0238019.ref018">18</xref>, <xref ref-type="bibr" rid="pone.0238019.ref019">19</xref>].</p>
<p>Despite the far-reaching importance of this topic, social scientists know little about social network responsiveness: how social networks react to and recover from intentional attacks. Most research has examined static networks compiled from cross-sectional data [<xref ref-type="bibr" rid="pone.0238019.ref001">1</xref>, <xref ref-type="bibr" rid="pone.0238019.ref002">2</xref>, <xref ref-type="bibr" rid="pone.0238019.ref007">7</xref>, <xref ref-type="bibr" rid="pone.0238019.ref009">9</xref>, <xref ref-type="bibr" rid="pone.0238019.ref011">11</xref>, <xref ref-type="bibr" rid="pone.0238019.ref014">14</xref>].</p>
<p>Yet, given that social networks contain human actors who are capable of rational behavior, it is likely that social networks adapt to attacks and possible that actors strive to insulate the network from additional damage. Moreover, prior studies have largely assessed attack strategies that isolate and remove structurally integral vertices—vertices that are highly connected or broker otherwise disjointed network components. Since attackers rarely have complete information on network structure or easy-access to influential actors [<xref ref-type="bibr" rid="pone.0238019.ref007">7</xref>, <xref ref-type="bibr" rid="pone.0238019.ref015">15</xref>, <xref ref-type="bibr" rid="pone.0238019.ref019">19</xref>], these findings tell us little about the vulnerability or responsiveness of social networks to commonly used diffuse attack strategies which target the network at large, rather than a few focal actors.</p>
<p>These limitations are especially pressing in research on criminological networks (e.g., gangs, drug markets), where structurally integral actors are usually inaccessible, most network behavior is hidden, actors have strong incentives to limit periods of inactivity, and findings bear on public well-being [<xref ref-type="bibr" rid="pone.0238019.ref018">18</xref>–<xref ref-type="bibr" rid="pone.0238019.ref021">21</xref>]. Data on criminal networks also tend to come from court or police records of captured crime rings [<xref ref-type="bibr" rid="pone.0238019.ref009">9</xref>, <xref ref-type="bibr" rid="pone.0238019.ref010">10</xref>, <xref ref-type="bibr" rid="pone.0238019.ref014">14</xref>, <xref ref-type="bibr" rid="pone.0238019.ref019">19</xref>–<xref ref-type="bibr" rid="pone.0238019.ref022">22</xref>], meaning that findings from current research are biased towards inactive and “unsuccessful” networks. Moreover, while crimes like homicide and motor vehicle theft are generally well recorded, most other index offense crimes including robbery, larceny, rape, assault, and drug crimes are under reported, and thus, data on crime occurrence—either from self-report or official records—are often inaccurate. Consequently, it is difficult to trace future levels of criminal activity to successful network attacks in the past.</p>
<p>Further, data on criminal networks are limited in availability, and, as a result, past studies have been forced to rely on metrics of criminal interaction that indirectly measure the mechanics of criminal behavior [<xref ref-type="bibr" rid="pone.0238019.ref023">23</xref>, <xref ref-type="bibr" rid="pone.0238019.ref024">24</xref>]. For instance, Natarajan [<xref ref-type="bibr" rid="pone.0238019.ref025">25</xref>] studied the structure of a heroin distribution network using wiretapped telecommunications. McGloin [<xref ref-type="bibr" rid="pone.0238019.ref022">22</xref>] aggregated over multiple types of affiliation data recorded during semi-structured interviews with police officers to construct a network of gang affiliation, including co-offending and having spent time together in prison. Criminal network data is also usually incomplete, necessitating researchers to assume that the observed network segment is an adequate representation of the unmeasured criminal network. Yet, to pinpoint how criminal networks respond to attacks and to assess the consequences of intentional attacks for crime occurrence, it is essential to observe an entire criminal network over a substantial length of time with accurate information on each participant’s involvement in crime.</p>
<p>To overcome these limitations, we make use of population-level data on a large darknet drug market observed over 14 months. Darknet drug markets are online marketplaces that can be accessed using anonymizing web services to purchase illicit drugs (<xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>, Data). These data have numerous advantages. First, unlike data obtained from surveys or official records, these data are collected through observations of a currently-active criminal network; thus, they contain accurate reports of each market actor’s involvement in illicit drug trade. Second, since all drug transactions are recorded, we observe the entire population of drug exchanges from the birth of the market to the end of data collection. Third, data are collected digitally, so the growth of the market can be observed as it unfolds in real-time. Fourth, online drug exchange is growing more prevalent, as it connects drug distributors and consumers across the globe [<xref ref-type="bibr" rid="pone.0238019.ref026">26</xref>–<xref ref-type="bibr" rid="pone.0238019.ref029">29</xref>]. Thus, it is not only methodologically fruitful to examine online drug trade, but informative of an increasingly common form of crime.</p>
<p>Data for our study come from one of the largest currently operating darknet drug markets, <italic>Silk Road 3</italic>.<italic>1</italic>. They contain information on 16,847 illicit drug transactions between 7,126 buyers and 169 vendors, representing the entire population of drug transactions on the <italic>Silk Road 3</italic>.<italic>1</italic> during its first 14 months of activity (S1 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). From these data, we reconstructed a bipartite network, where a tie connects a buyer and a vendor if the buyer has purchased drugs from that vendor. Next, we designed an empirically grounded agent-based model [<xref ref-type="bibr" rid="pone.0238019.ref030">30</xref>–<xref ref-type="bibr" rid="pone.0238019.ref032">32</xref>]. We discuss the assumptions of the agent-based model in some detail in the <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>. We first used stochastic actor-oriented models to evaluate why buyers purchase from specific vendors in the <italic>Silk Road 3</italic>.<italic>1</italic> drug exchange network (Model 1, S2 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). We then used the coefficients obtained from stochastic actor-oriented modeling to inform agent decision- making in the simulation. The result is an agent-based simulation with empirically validated rules for agent behavior (<italic>Materials and Methods</italic>). The simulated outcome networks represent the agent-based model’s best estimates of the <italic>Silk Road 3</italic>.<italic>1</italic> drug market at its last moment of observation. By manipulating characteristics of the raw data and repeating the simulation, we can evaluate the effect of various attack strategies on network development.</p>
<p>We consider three attack strategies: targeted attacks, weak link attacks, and signal attacks. Targeted attacks are those that remove structurally integral vertices. Consistent with prior research [<xref ref-type="bibr" rid="pone.0238019.ref002">2</xref>, <xref ref-type="bibr" rid="pone.0238019.ref009">9</xref>–<xref ref-type="bibr" rid="pone.0238019.ref011">11</xref>, <xref ref-type="bibr" rid="pone.0238019.ref014">14</xref>], we operationalized targeted attacks by deleting highly connected vendors from the market (<xref ref-type="table" rid="pone.0238019.t001">Table 1</xref>). Our second attack strategy is a weak link attack, where we delete large numbers of weakly connected actors at once. This attack strategy is one that is often used to police open-air drug markets, where numerous low-level drug dealers and users are arrested in quick succession [<xref ref-type="bibr" rid="pone.0238019.ref033">33</xref>]. Our third attack strategy is the signal attack. Signal attacks impede network development by saturating a network with noisy signals. The rise of social media has made signal attacks more common. As an example, social media giants like <italic>Facebook</italic> and <italic>Twitter</italic> have recently struggled to insulate their online platforms against the spread of political propaganda [<xref ref-type="bibr" rid="pone.0238019.ref034">34</xref>], and online markets like <italic>eBay</italic> routinely grapple with opinion spamming through fake sales reviews [<xref ref-type="bibr" rid="pone.0238019.ref035">35</xref>]. We implement signal attacks by reducing the number of positive sales ratings a vendor has received. We conducted each attack strategy at four levels of intervention, reflecting increasingly aggressive attacks (<xref ref-type="table" rid="pone.0238019.t001">Table 1</xref>). Our control group contains networks which were simulated without any treatment (S1 Fig in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). With one control condition and three attack strategies at four levels of intervention, our study includes 12 (3 x 4) treatment conditions and one control group. To ensure that our results are not idiosyncratic to a specific simulated change process, we repeated our agent-based simulation 100 times for each level of the experiment. Across levels of treatment, this yielded a total of 1,300 networks containing 10,213,770 buyers, 255,504 vendors, and 7,060,303 drug exchanges for analysis.</p>
<table-wrap id="pone.0238019.t001" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0238019.t001</object-id>
<label>Table 1</label> <caption><title>Experiment design.</title> <p>Degree centrality is the raw sum of ties incident to an actor.</p></caption>
<alternatives>
<graphic id="pone.0238019.t001g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0238019.t001" xlink:type="simple"/>
<table>
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="left">Attack Strategy</th>
<th align="left">Measurement</th>
<th align="left" colspan="2">Level of Intervention</th>
<th align="left"/>
<th align="left"/>
</tr>
<tr>
<th align="left"/>
<th align="left"/>
<th align="left">Low</th>
<th align="left">Medium-low</th>
<th align="left">Medium-high</th>
<th align="left">High</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Targeted attack</td>
<td align="left">Delete vendors in top <italic>n</italic>th percentile of degree centrality.</td>
<td align="left">20th</td>
<td align="left">40th</td>
<td align="left">60th</td>
<td align="left">80th</td>
</tr>
<tr>
<td align="left">Weak link attack</td>
<td align="justify">Delete buyers in bottom <italic>n</italic>th percentile of degree centrality.</td>
<td align="left">20th</td>
<td align="left">40th</td>
<td align="left">60th</td>
<td align="left">80th</td>
</tr>
<tr>
<td align="left">Signal attack</td>
<td align="left">Reduce vendors’ cumulative sales ratings by <italic>n</italic> %</td>
<td align="left">20%</td>
<td align="left">40%</td>
<td align="left">60%</td>
<td align="left">80%</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
</sec>
<sec id="sec002" sec-type="results">
<title>Results</title>
<p>Are criminal networks vulnerable to intentional attacks? We first use methods developed in cross-sectional research to provide a baseline for comparing results from agent-based simulation. A common way to assess network vulnerability is to examine preferential attachment—the tendency for buyers to purchase from drug distributors with large degree centrality—since networks with high levels of preferential attachment tend to be vulnerable to targeted attacks [<xref ref-type="bibr" rid="pone.0238019.ref001">1</xref>, <xref ref-type="bibr" rid="pone.0238019.ref007">7</xref>, <xref ref-type="bibr" rid="pone.0238019.ref008">8</xref>]. <xref ref-type="fig" rid="pone.0238019.g001">Fig 1</xref> illustrates that there are a handful of highly connected vendors, where 56% of drug transactions involve only 10% of vendors in the aggregate network. We formally assess preferential attachment by calculating the degree-scaling coefficient (<xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>, Measurement), a commonly used indicator of preferential attachment [<xref ref-type="bibr" rid="pone.0238019.ref001">1</xref>, <xref ref-type="bibr" rid="pone.0238019.ref036">36</xref>, <xref ref-type="bibr" rid="pone.0238019.ref037">37</xref>]. The degree-scaling coefficient is 1.52 (Kolmogorov-Smirnov statistic = .12, <italic>P</italic> =. 99, null hypothesis is that the degree-scaling coefficient is not zero, S1 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>), reflecting high levels of preferential attachment and, thus, vulnerability to intentional attacks. A second strategy for gauging network vulnerability is to compute the degree-degree correlation (<xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>, Measurement), where positive values indicate that the network is robust to intentional attacks and negative values indicate vulnerability [<xref ref-type="bibr" rid="pone.0238019.ref011">11</xref>, <xref ref-type="bibr" rid="pone.0238019.ref013">13</xref>, <xref ref-type="bibr" rid="pone.0238019.ref014">14</xref>]. The degree-degree correlation is -.07 (S1 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>), suggesting vulnerability. This is supported by vertex deletion simulations showing that the network can be completely dismantled by deleting 35% of the vendors on the market, and 20.3% of buyers are rendered isolates by deleting only 10 vendors (S2 Fig in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). Collectively, results from cross-sectional analyses suggest that the network is vulnerable to intentional attacks and replicate several prior findings on criminal network vulnerability [<xref ref-type="bibr" rid="pone.0238019.ref006">6</xref>, <xref ref-type="bibr" rid="pone.0238019.ref009">9</xref>, <xref ref-type="bibr" rid="pone.0238019.ref014">14</xref>, <xref ref-type="bibr" rid="pone.0238019.ref020">20</xref>]. But, are these conclusions supported when we account for network responsiveness?</p>
<fig id="pone.0238019.g001" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0238019.g001</object-id>
<label>Fig 1</label>
<caption>
<title><italic>Silk Road 3</italic>.<italic>1</italic> drug exchange network over time.</title>
<p>Blue nodes are buyers, red nodes are vendors, and lines are illicit drug transactions. Node size is proportional to buyer/vendor degree centrality. In Panel A, 𝑛<sub>𝑏𝑢𝑦𝑒𝑟𝑠</sub> = 505, 𝑛<sub>𝑣𝑒𝑛𝑑𝑜𝑟𝑠</sub> = 50, 𝑛<sub>𝑡𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠</sub> = 1,110. In Panel B, 𝑛𝑏𝑢𝑦𝑒𝑟𝑠 = 2,977, 𝑑𝑜𝑟𝑠 = 121, 𝑛𝑡𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠 = 6,736. In Panel C, 𝑛𝑏𝑢 = 4,323, 𝑛<sub>𝑣𝑒𝑛𝑑𝑜𝑟𝑠</sub> = 101, 𝑛<sub>𝑡𝑟𝑎𝑛𝑠𝑎𝑐𝑡𝑖𝑜𝑛𝑠</sub> = 9,001.</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0238019.g001" xlink:type="simple"/>
</fig>
<p>The problem of network responsiveness can be characterized by two questions: Do intentional attacks affect network activity in the long run? And, do networks adapt to attacks over time? To address these questions, we turn to results from agent-based simulation.</p>
<p>Our first concern is to assess how much criminal activity is deterred by an attack. <xref ref-type="fig" rid="pone.0238019.g002">Fig 2A</xref> considers change in the number of illicit drug transactions. There is no significant difference between low-levels of targeted attacks and the control conditions (<italic>t</italic> = -1.01, <italic>P</italic> = .31). However, at the medium-low level of intervention, there is a precipitous decline in the number of drug transactions. After this decrease, the marginal declines in the number of drug transactions are minimal. Weak link attacks and signal attacks tend to reduce the level of drug trafficking more- so than targeted attacks at low levels of intervention. Here, weak link attacks yield a 13.2% decrease in the number of illicit drug exchanges on average, and signal attacks yield a 13.1% decrease, deterring roughly 750 drug exchanges that would have otherwise occurred. This difference reverses at higher levels of intervention, where targeted attacks decrease the number of illicit drug exchanges more-so than either weak link or signal attacks, indicating that targeted attacks are most effective when they are deployed at a large scale. We used ordinary least squares linear regression to assess the mean effect of each attack strategy on the number of drug transactions in a simulated network. Holding the level of intervention constant, weak link attacks prevent, on average, 2,404 drug transactions that would have otherwise occurred (<italic>β</italic> = -2,404, CI = [–2,578, –2,230], <italic>P</italic> &lt; .001, Model 2, S3 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>), and targeted attacks prevent 611 drug transactions (<italic>β</italic> = -611, CI = [–640, –571], <italic>P</italic> &lt; .001, Model 2, S3 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). Signal attacks prevent 151 drug transactions that occurred in the control group, but the difference is not significant when controlling for the level of intervention (<italic>β</italic> = -151, CI = [–325, 23], <italic>P</italic> = .09, Model 2, S3 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>).</p>
<fig id="pone.0238019.g002" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0238019.g002</object-id>
<label>Fig 2</label>
<caption>
<title>Criminal activity by level of intervention and attack strategy (<italic>n</italic> = 1,200 networks).</title>
<p><italic>Y</italic> axis is proportion of control group (treatment divided by control group). <italic>X</italic> axis is the level of intervention, where a 1 is low intervention, 2 is medium-low, 3 is medium-high, and 4 is high. Boxplots are plotted using the Tukey method. Grey boxplots are targeted attacks (<italic>n</italic> = 400), yellow boxplots are weak link attacks (<italic>n</italic> = 400), blue boxplots are signal attacks (<italic>n</italic> = 400). The correlation between the level of intervention and the number of ties is -.84 (<italic>P</italic> &lt; .001) for the targeted attack strategy, .99 (<italic>P</italic> &lt; .001) for the weak link strategy, and -.79 (<italic>P</italic> &lt; .001) for the signal attack. The correlation between the level of intervention and the number of isolates is -.84 (<italic>P</italic> &lt; .001) for the targeted attack strategy, -.99 (<italic>P</italic> &lt; .001) for the weak link attack strategy, and .79 (<italic>P</italic> &lt; .001) for the signal strategy.</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0238019.g002" xlink:type="simple"/>
</fig>
<p><xref ref-type="fig" rid="pone.0238019.g002">Fig 2B</xref> considers a second indicator of criminal activity: the number of isolates.</p>
<p>Isolates are actors (typically buyers) who are not connected to any other actor. Increases in the number of isolates reflect actors who would have otherwise purchased illicit drugs but were deterred from doing so. At low levels of intervention, targeted attacks do not substantially affect the number of isolates. In contrast, signal attacks yield a 20.4% increase in the number of isolates—an average of 372 buyers who would have purchased illicit drugs if the network had not been attacked. At higher levels of intervention, signal attacks continue to increase the number of isolates, albeit less-so than targeted attacks. Weak link attacks decrease the number of isolates linearly across levels of intervention. This is because weak link attacks delete those actors who are most likely to be rendered isolates over time, reflecting incapacitation rather than deterrence (S5 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). Across attack strategies, most of the change in criminal activity can be attributed to the behaviors of weakly connected actors. While vendors’ degree centralities are relatively unchanged at higher levels of intervention, increasingly aggressive attacks generate a growing number of isolated and weakly connected buyers (<xref ref-type="fig" rid="pone.0238019.g003">Fig 3</xref>). We modeled the probability of becoming an isolate using conditional logistic regression, treating each unique actor as strata and clustering standard errors on networks. Controlling for attack strategy and level of intervention, weakly connected buyers have 70% (𝑒<sup>.529</sup>) higher odds of becoming an isolate than other buyers (<italic>β</italic> = .529, CI = [.529, .529], <italic>P</italic> &lt; .001, Model 3, S4 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>), and 57.4 times (𝑒<sup>3.941</sup>) higher odds of becoming an isolate than vendors (<italic>β</italic> = 3.941, CI = [3.941, 3.941], <italic>P</italic> &lt; .001 Model 3, S5 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). This indicates that structurally integral buyers and vendors are relatively unaffected by attacks, while weakly connected buyers are the most likely to be deterred.</p>
<fig id="pone.0238019.g003" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0238019.g003</object-id>
<label>Fig 3</label>
<caption>
<title>Density plots of buyers’ (<italic>n</italic> = 10,213,770) and vendors’ (<italic>n</italic> = 255,204) degree centrality (logged) by attack strategy.</title>
<p><italic>X</italic> axis is the natural log of degree centrality, <italic>Y</italic> axis is the frequency. Darker shades correspond to higher levels of intervention; lighter shades correspond to lower levels of intervention.</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0238019.g003" xlink:type="simple"/>
</fig>
<p>Collectively, these results illustrate that weak link and signal attacks reduce more criminal activity at low levels of intervention than targeted attacks, and that weak link attacks are the most effective for reducing criminal activity net of the level of intervention. These findings contrast with cross-sectional research on network vulnerability, which generally finds that most static and non-responsive networks can be dismantled with a relatively small number of targeted nodal deletions [<xref ref-type="bibr" rid="pone.0238019.ref001">1</xref>, <xref ref-type="bibr" rid="pone.0238019.ref004">4</xref>–<xref ref-type="bibr" rid="pone.0238019.ref006">6</xref>, <xref ref-type="bibr" rid="pone.0238019.ref008">8</xref>, <xref ref-type="bibr" rid="pone.0238019.ref015">15</xref>], especially those characterized by high preferential attachment and negative degree-degree correlation [<xref ref-type="bibr" rid="pone.0238019.ref001">1</xref>, <xref ref-type="bibr" rid="pone.0238019.ref007">7</xref>, <xref ref-type="bibr" rid="pone.0238019.ref011">11</xref>–<xref ref-type="bibr" rid="pone.0238019.ref014">14</xref>]. Also in contrast to prior research, results indicate that much of the change in criminal activity can be attributed to weakly connected actors’ unwillingness to purchase drugs, rather than the immediate disruptive effect of deleting structurally integral actors.</p>
<p>Our second concern is to identify how network behaviors change in the aftermath of an attack. On one hand, attacks may debilitate a network, leaving lasting damage and rendering it vulnerable to additional attacks; on the other hand, attacks may incentivize a network to insulate itself against further damage. We evaluate these possibilities by calculating the degree scaling coefficient and degree-degree correlation for each simulated network. Change in degree scaling is modest for each attack strategy (<xref ref-type="fig" rid="pone.0238019.g004">Fig 4A</xref>). Targeted and signal attacks tend to increase degree scaling, while weak link attacks tend to decrease it. This indicates that signal and targeted attacks increase network vulnerability, albeit modestly, by increasing the visibility of leading actors. Turning to degree-degree correlation (assortativity), targeted attacks do not yield noteworthy changes in assortativity at low levels of intervention, though higher levels of intervention do decrease assortativity. For weak link attacks, there is an inverse correlation between the level of intervention and assortativity (<italic>r =</italic> -.68, <italic>P</italic> &lt; .001, <xref ref-type="fig" rid="pone.0238019.g004">Fig 4B</xref>), indicating that weak link attacks increase network vulnerability. Signal attacks tend to increase assortativity. However, these gains in assortativity stem, in part, from the large number of isolates which are generated by signal attacks (<xref ref-type="fig" rid="pone.0238019.g005">Fig 5</xref>, see <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>, Assortativity and Isolates for discussion). These results illustrate that intentional attacks increase network vulnerability in responsive networks, either by increasing preferential attachment or by decreasing degree-degree correlation.</p>
<fig id="pone.0238019.g004" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0238019.g004</object-id>
<label>Fig 4</label>
<caption>
<title>Network behavior by level of intervention and attack strategy (<italic>n</italic> = 1,200 networks).</title>
<p><italic>Y</italic> axis is proportion of control group (treatment divided by control group). <italic>X</italic> axis is the level of intervention, where a 1 is low intervention, 2 is medium-low, 3 is medium-high, and 4 is high. Boxplots are plotted using the Tukey method. Grey boxplots are targeted attacks (<italic>n</italic> = 400), yellow boxplots are weak link attacks (<italic>n</italic> = 400), blue boxplots are signal attacks (<italic>n</italic> = 400). Assortativity is reverse coded to facilitate interpretation since the control-group has negative assortativity (mean = -.32). Thus, -1 is equal to no difference from the control group in Panel B. The correlation between the level of intervention and degree scaling is .26 (<italic>P</italic> &lt; .001) for the targeted attack strategy, -.30 (<italic>P</italic> &lt; .001) for the weak link strategy, and .23 (<italic>P</italic> &lt; .001) for the signal attack. The correlation between the level of intervention and assortativity is -.88 (<italic>P</italic> &lt; .001) for the targeted attack strategy, -.68 (<italic>P</italic> &lt; .001) for the weak link attack strategy, and .76 (<italic>P</italic> &lt; .001) for the signal attack strategy.</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0238019.g004" xlink:type="simple"/>
</fig>
<fig id="pone.0238019.g005" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0238019.g005</object-id>
<label>Fig 5</label>
<caption>
<title>Association between assortativity and the number of isolates across treatment conditions (<italic>n</italic> = 1,200 networks).</title>
<p>Density plots on the <italic>x</italic> and <italic>y</italic> axes denote the univariate distribution for assortativity and the number of isolates for each treatment condition. Dashed vertical line marks the approximate point at which the number of isolates is inversely associated with assortativity (3,200 isolates). Grey dots are targeted attacks (<italic>n</italic> = 400), yellow dots are weak link attacks (<italic>n</italic> = 400), blue dots are signal attacks (<italic>n</italic> = 400).</p>
</caption>
<graphic mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0238019.g005" xlink:type="simple"/>
</fig>
<p>Next, we assess the micro-mechanisms that generate these high levels of preferential attachment and low levels of degree-degree correlation. Results from our primary stochastic actor-oriented models suggest that much of the preferential attachment observed in the empirical network is driven by vendors’ reputations (cumulative sales ratings) (<italic>β</italic> = .0005, CI = [.0005.0005], <italic>P</italic> &lt; .001, Model 1, S2 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). To assess preferential attachment in the wake of an attack, we modeled vendors’ degree centrality in the simulated networks using linear mixed models, with simulated vendors nested in simulated networks, and simulated networks nested in empirically observed vendors. Consistent with stochastic actor-oriented models, vendor- reputations drive preferential attachment in the simulated networks (<italic>β</italic> = .162, CI = [.162, .162], <italic>P</italic> &lt; .001, Model 3, S6 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). This result replicates several prior findings on the importance of reputations for cooperation in economic games and criminal networks [<xref ref-type="bibr" rid="pone.0238019.ref006">6</xref>, <xref ref-type="bibr" rid="pone.0238019.ref019">19</xref>, <xref ref-type="bibr" rid="pone.0238019.ref037">37</xref>, <xref ref-type="bibr" rid="pone.0238019.ref038">38</xref>]. Turning to the micro-level sources of degree-degree correlation, we model the difference in degree centralities between buyers and vendors who have exchanged drugs using linear mixed models, with differences in degree centralities nested in networks. As above, micro-level assortativity is largely driven by preferential attachment towards reputable vendors (<italic>β</italic> = .019, CI = [.019, .019], <italic>P</italic> &lt; .001, Model 3, S7 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>), as well as the number of isolates in the network (<italic>β</italic> = -.001, CI = [-.001, -.001], <italic>P</italic> &lt; .001, Model 3, S7 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). This indicates that, when networks are attacked, buyers grow more cautious about their purchasing habits, leading them to simultaneously make fewer drug purchases and, when they do purchase, only purchase drugs from vendors with good reputations. In doing so, they increase overall network vulnerability.</p>
</sec>
<sec id="sec003" sec-type="conclusions">
<title>Discussion</title>
<p>The findings in this study provide important insight to the problem of network responsiveness. First, we find that cross-sectional methods can provide misleading assessments of network vulnerability when the network is dynamic. This suggests that prior evidence showing that social networks exhibit high levels of robustness [<xref ref-type="bibr" rid="pone.0238019.ref011">11</xref>] may need to be revisited with network responsiveness in mind. Second, we find that diffuse attack strategies can outperform targeted attacks in terms of curbing long-term network activity. This finding illustrates that attackers may be successful in debilitating network activity even when they have limited information on network structure or limited access to key players. This is consistent with prior studies showing that many networks are vulnerable to attacks conducted at random or with incomplete information on network structure [<xref ref-type="bibr" rid="pone.0238019.ref004">4</xref>, <xref ref-type="bibr" rid="pone.0238019.ref005">5</xref>, <xref ref-type="bibr" rid="pone.0238019.ref007">7</xref>]. Third, we find that most of the change in network activity and network structure after an attack can be attributed to the behaviors of weakly connected actors, rather than structurally integral ones. This is again in contrast to cross- sectional research on network vulnerability, which generally assumes that highly connected actors are a critical vulnerability in common network topologies [<xref ref-type="bibr" rid="pone.0238019.ref006">6</xref>–<xref ref-type="bibr" rid="pone.0238019.ref009">9</xref>].</p>
<p>Finally, results indicate that network attacks can create a game theoretic dilemma in responsive networks, where actors’ attempts to protect themselves by exchanging drugs with only the most reputable vendors ultimately increases network vulnerability. Consequently, collective action may be necessary to improve network robustness following intentional attacks, as egoistic action undermines network security. Future research on network responsiveness should consider how collective norms or rules for cooperation may promote network recovery and long-term robustness in disrupted environments.</p>
<p>Results also carry policy implications. Few prior studies have been able to tie levels of criminal activity to network-based interventions. Findings indicate that small-scale targeted attacks do little to curb drug trafficking in the long-run. This raises questions about crime policy recommendations based on cross-sectional research, which generally propounds allocating resources to identifying and arresting a handful of structurally integral criminals [<xref ref-type="bibr" rid="pone.0238019.ref003">3</xref>, <xref ref-type="bibr" rid="pone.0238019.ref006">6</xref>, <xref ref-type="bibr" rid="pone.0238019.ref009">9</xref>, <xref ref-type="bibr" rid="pone.0238019.ref014">14</xref>, <xref ref-type="bibr" rid="pone.0238019.ref018">18</xref>–<xref ref-type="bibr" rid="pone.0238019.ref022">22</xref>]. While findings for small-scale targeted attacks may be discouraging, results for diffuse attacks are enheartening. For one, we find that weak link attacks are, on average, the most effective for reducing levels of criminal activity. Moreover, one implication of the finding that weak link attacks decrease degree-degree correlation is that they may be effective for priming a network for future attacks. Likewise, results for signal attacks suggest that they may be a viable attack strategy when resources are unavailable to physically arrest market actors.</p>
<p>Our use of online drug trade data necessarily encounters limitations. In general, examining digital traces increases the reliability, accuracy, and scale of the data [<xref ref-type="bibr" rid="pone.0238019.ref039">39</xref>]. Moreover, our use of darknet drug trade data gives unique insight to a large, currently active, and dynamic criminal network. Nevertheless, it is an open empirical question whether results for crime conducted through a digital medium translate to the bulk of crime conducted offline. Likewise, a strength of agent-based simulation is the ability to conduct experiments at a scale which is typically unfeasible. A weakness, however, is that the data generated from simulation models are synthetic (albeit based on empirical data gathered from an active darknet drug market). If possible, data generated from experiments where attacks are carried out and change in the network is assessed would be ideal for validating our conclusions.</p>
<p>Despite the far-reaching scientific importance of network vulnerability, there has been markedly less research on the problem of network responsiveness [<xref ref-type="bibr" rid="pone.0238019.ref020">20</xref>, <xref ref-type="bibr" rid="pone.0238019.ref021">21</xref>]. This omission is particularly pressing in research on social networks, where actors can be expected to exhibit rational adaptations to network disruptions. Results provide strong evidence that actors in criminal networks exhibit rational responses to attacks and that these adaptations can undermine overall network robustness. Moreover, findings reveal that cross-sectional methods can lead to misleading conclusions about network vulnerability when the network being studied is dynamic in nature. Collectively, results highlight the need to consider network responsiveness when examining the vulnerabilities of social and other dynamic networks.</p>
</sec>
<sec id="sec004" sec-type="materials|methods">
<title>Materials and methods</title>
<p>Darknet drug markets are anonymous online marketplaces where users from across the globe can purchase illicit drugs, such as heroin and methamphetamine, from anonymous vendors and have the drugs delivered to their door steps through a postal service. They function akin to Clearnet markets (e.g., <italic>eBay</italic>), incorporating drug listings, vendor reputation scores, and histories of product reviews left by previous buyers. We constructed our network by gathering data from each vendor’s web page between the first date of market operation, January 2017, and February 2018. Additional details are provided in the <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref> (Data). The Ohio State HSIRB exempt the study from ethical oversight as all data are digital trace data and can be accessed publicly. All data were analyzed using website specific pseudonyms (usernames) that are not connected in any known way to persons' true offline identities. No efforts were taken to anonymize data during analysis because darknet encryption software makes it extremely difficult to link usernames to individual persons.</p>
<p>Our agent-based simulation experiment was conducted in four steps. We discuss the design, assumptions, and mathematical definition of the agent-based simulation in detail in the <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref> (Estimation). In Step 1, we fit a stochastic actor-oriented model to the observed network to identify the determinants of market growth [<xref ref-type="bibr" rid="pone.0238019.ref040">40</xref>]. The model entails simulating network change from the raw data and then fitting a multinomial logistic regression to the simulated data. Actors in the network are offered a probabilistically determined number of opportunities to change ties based on a rate function (<xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref> Estimation). When offered the opportunity to change a tie, an actor chooses the tie that offers the largest increase to the objective function:
<disp-formula id="pone.0238019.e001">
<alternatives>
<graphic id="pone.0238019.e001g" mimetype="image" position="anchor" xlink:href="info:doi/10.1371/journal.pone.0238019.e001" xlink:type="simple"/>
<mml:math display="block" id="M1">
<mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>β</mml:mi><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>∑</mml:mo><mml:mi>k</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>β</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mstyle><mml:msub><mml:mi>s</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow>
</mml:math>
</alternatives>
</disp-formula>
Where 𝛽<sub>𝑘</sub> are the parameterized covariate effects provided by the researcher and (𝑥) are functions of the data computed on the observed network at each step in the simulation. An actor may choose not to form a tie if there is no tie which increases the value of the objective function. Tie changes are then recorded and the network state is updated. Since the simulation can be regarded as a continuous-time Markov chain, the actual passage of time between observations of the network is arbitrary [<xref ref-type="bibr" rid="pone.0238019.ref040">40</xref>]. As is common, we estimated the model through method of moments using a stochastic approximation algorithm. Additional details are provided in the <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>, along with a discussion of control variables, model specification, and full model results (S2 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). After estimating the model and ensuring good fit, we recorded the parameter vector (𝛽) to be used in agent-based simulation.</p>
<p>In Step 2, we implemented the manipulations to the observed data as outlined in <xref ref-type="table" rid="pone.0238019.t001">Table 1</xref>.</p>
<p>In Step 3, we initiated the agent-based simulation by using stochastic actor-oriented models to simulate a range of potential network outcomes based on the manipulated data. Since stochastic actor-oriented models have a simulation basis, this merely entailed estimating an agent-based model with the same rules for actor behavior as outlined above and storing the simulated networks [see <xref ref-type="bibr" rid="pone.0238019.ref041">41</xref>, <xref ref-type="bibr" rid="pone.0238019.ref042">42</xref>]. The parameters of the agent-based simulation are fixed to be equivalent to the coefficients estimated in Step 1 (Model 1, S2 Table in <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>). This ensures external validity by basing the parameters of the agent-based model on statistical analysis of empirical data [<xref ref-type="bibr" rid="pone.0238019.ref039">39</xref>, <xref ref-type="bibr" rid="pone.0238019.ref040">40</xref>]. Since we estimate the agent-based model by using a stochastic actor-oriented model to simulate from manipulated data, the various attack strategies can be regarded as influencing agent behavior by changing their respective evaluations of the objective function (<xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref>, Simulation). We repeated the agent-based simulation 100 times for each condition to ensure that the results from the simulations are not idiosyncratic to a single stochastic process. In Step 4, we record structural characteristics of the networks and its actors for analysis. We recorded the number of ties, number of isolates, and actors’ degree centrality, and we computed the degree- degree correlation and degree scaling coefficient for the output networks. Equations for each structural measure are available in the <xref ref-type="supplementary-material" rid="pone.0238019.s001">S1 Appendix</xref> (Measurement). We analyzed the data using linear mixed models (random intercepts) for the degree centrality and difference in degree centrality outcomes, ordinary least squares regression for the drug trafficking volume outcome, and conditional logistic regression for the probability of becoming an isolate.</p>
</sec>
<sec id="sec005">
<title>Supporting information</title>
<supplementary-material id="pone.0238019.s001" mimetype="application/vnd.openxmlformats-officedocument.wordprocessingml.document" position="float" xlink:href="info:doi/10.1371/journal.pone.0238019.s001" xlink:type="simple">
<label>S1 Appendix</label>
<caption>
<title/>
<p>(DOCX)</p>
</caption>
</supplementary-material>
</sec>
</body>
<back>
<ref-list>
<title>References</title>
<ref id="pone.0238019.ref001"><label>1</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Albert</surname> <given-names>R</given-names></name>, <name name-style="western"><surname>Hawoong</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Barabasi</surname> <given-names>AL</given-names></name>. <article-title>Error and attack tolerance of complex networks</article-title>. <source><italic>Nature</italic></source>. <year>2000</year>; <volume>406</volume>: <fpage>378</fpage>–<lpage>382</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref002"><label>2</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Alm</surname> <given-names>JF</given-names></name>, <name name-style="western"><surname>Mack</surname> <given-names>KML</given-names></name>. <article-title>2017. Degree-correlation, robustness, and vulnerability in finite scale-free networks</article-title>. <source><italic>Asian Research Journal of Mathematics</italic></source> <year>2017</year>; <volume>2</volume>: <fpage>1</fpage>–<lpage>6</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref003"><label>3</label><mixed-citation publication-type="book" xlink:type="simple"><name name-style="western"><surname>Bright</surname> <given-names>DA</given-names></name>. <source>Disrupting and Dismantling Dark Networks: Lessons from Social Network Analysis and Computer Simulation</source>. in <collab><italic>Illuminating Dark Networks</italic></collab>, <name name-style="western"><surname>Gerdes</surname> <given-names>L</given-names></name>, editors. <publisher-name>Cambridge University Press</publisher-name>; <year>2015</year>. pp. <fpage>39</fpage>–<lpage>51</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref004"><label>4</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Callaway</surname> <given-names>DS</given-names></name>, <name name-style="western"><surname>Newman</surname> <given-names>MEJ</given-names></name>., <article-title>Strogatz, SH, Watts, DJ. Network Robustness and Fragility: Percolation on Random Graphs</article-title>. <source><italic>Physical Review Letters</italic></source> <year>2000</year>; <volume>85</volume>: <fpage>5468</fpage>–<lpage>5471</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref005"><label>5</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Cohen</surname> <given-names>R</given-names></name>, <name name-style="western"><surname>Erez</surname> <given-names>K</given-names></name>, <name name-style="western"><surname>Ben-Avraham</surname> <given-names>D</given-names></name>, <name name-style="western"><surname>Havlin</surname> <given-names>S.</given-names></name> <article-title>Resilience of the Internet to Random Breakdowns</article-title>. <source><italic>Physical Review Letters</italic></source> <year>2000</year>; <volume>85</volume>: <fpage>4626</fpage>–<lpage>4628</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref006"><label>6</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Duxbury</surname> <given-names>SW</given-names></name>, <name name-style="western"><surname>Haynie</surname> <given-names>DL</given-names></name>. <article-title>Building them up, Breaking them down: Topology, vendor selection, and a digital drug market’s robustness to disruption</article-title>. <source><italic>Social Networks</italic></source> <year>2018</year>; <volume>52</volume>: <fpage>238</fpage>–<lpage>250</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref007"><label>7</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Gallos</surname> <given-names>LK</given-names></name>, <name name-style="western"><surname>Cohen</surname> <given-names>R</given-names></name>, <name name-style="western"><surname>Argyrakis</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Bunde</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Havlin</surname> <given-names>S.</given-names></name> <article-title>Stability and Topology of Scale-Free Networks under Attack and Defense Strategies</article-title>. <source><italic>Physical Review Letters</italic></source> <year>2005</year>; <volume>94</volume>: <fpage>188701</fpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref008"><label>8</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Holme</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Kim</surname> <given-names>BJ</given-names></name>, <name name-style="western"><surname>Yoon</surname> <given-names>CN</given-names></name>, <name name-style="western"><surname>Han</surname> <given-names>SK</given-names></name>. <article-title>Attack vulnerability of complex networks</article-title>. <source><italic>Physical Review E</italic></source> <year>2002</year>; <volume>65</volume>: <fpage>056109</fpage></mixed-citation></ref>
<ref id="pone.0238019.ref009"><label>9</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Malm</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Bichler</surname> <given-names>G.</given-names></name> <article-title>Networks of collaborating criminals: Assessing the structural vulnerability of drug markets</article-title>. <source><italic>Journal of Research in Crime and Delinquency</italic></source>. <year>2011</year>; <volume>48</volume>: <fpage>271</fpage>–<lpage>297</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref010"><label>10</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Morselli</surname> <given-names>C</given-names></name>, <name name-style="western"><surname>Roy</surname> <given-names>J.</given-names></name> <article-title>Brokerage Qualifications in Ringing Operations</article-title>. <source><italic>Criminology</italic></source> <year>2008</year>; <volume>46</volume>: <fpage>71</fpage>–<lpage>98</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref011"><label>11</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Newman</surname> <given-names>MEJ</given-names></name>. <article-title>Assortative mixing in networks</article-title>. <source><italic>Physical Review Letters</italic></source> <year>2002</year>; <volume>89</volume>: <fpage>208701</fpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref012"><label>12</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Shiraki</surname> <given-names>Y</given-names></name>, <name name-style="western"><surname>Kabashima</surname> <given-names>Y.</given-names></name> <article-title>Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations</article-title>. <source><italic>Physical Review E</italic></source> <year>2010</year>; <volume>82</volume>: <fpage>036101</fpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref013"><label>13</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Vazquez</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Moreno</surname> <given-names>Y.</given-names></name> <article-title>Resilience to damage of graphs with degree correlations</article-title>. <source><italic>Physical Review E</italic></source> <year>2003</year>; <volume>67</volume>: <fpage>015101</fpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref014"><label>14</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Wood</surname> <given-names>G.</given-names></name> <article-title>The structure and vulnerability of a drug trafficking collaboration network</article-title>. <source><italic>Social Networks</italic></source> <year>2017</year>; <volume>48</volume>: <fpage>1</fpage>–<lpage>9</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref015"><label>15</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Wu</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Deng</surname> <given-names>HZ</given-names></name>, <name name-style="western"><surname>Tan</surname> <given-names>YJ</given-names></name>, <name name-style="western"><surname>Zhu</surname> <given-names>DZ</given-names></name>. <article-title>Vulnerability of complex networks under intentional attack with incomplete information. <italic>Journal of Physics A</italic></article-title>: <source><italic>Mathematical and Theoretical</italic></source> <year>2007</year>; <volume>40</volume>: <fpage>2665</fpage>–<lpage>2671</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref016"><label>16</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Salathe</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Kazandjieva</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Lee</surname> <given-names>JW</given-names></name>, <name name-style="western"><surname>Levis</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Feldman</surname> <given-names>MW</given-names></name>, <name name-style="western"><surname>Jones</surname> <given-names>JH</given-names></name>. <article-title>A high-resolution human contact network for infectious disease transmission</article-title>. <source><italic>Proceedings of the National Academy of Sciences</italic></source> <year>2010</year>; <volume>107</volume>: <fpage>22,020</fpage>–<lpage>22,025</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref017"><label>17</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Lusseau</surname> <given-names>D</given-names></name>, <name name-style="western"><surname>Newman</surname> <given-names>MEJ</given-names></name>. <article-title>Identifying the role that animals play in their social networks</article-title>. <source><italic>Proceedings of the Royal Society Biology Letters</italic></source> <year>2004</year>; <volume>271</volume>: <fpage>477</fpage>–<lpage>481</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref018"><label>18</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Faust</surname> <given-names>K</given-names></name>, <name name-style="western"><surname>Tita</surname> <given-names>GE</given-names></name>. <article-title>Social networks and crime: Pitfalls and promises for advancing the field</article-title>. <source><italic>Annual Review of Criminology</italic></source> <year>2019</year>; <volume>2</volume>: <fpage>99</fpage>–<lpage>122</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref019"><label>19</label><mixed-citation publication-type="book" xlink:type="simple"><name name-style="western"><surname>Morselli</surname> <given-names>C.</given-names></name> <source><italic>Inside Criminal Networks</italic></source>. <publisher-name>Springer</publisher-name>; <year>2009</year>.</mixed-citation></ref>
<ref id="pone.0238019.ref020"><label>20</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Duijn</surname> <given-names>P</given-names></name>, <name name-style="western"><surname>Kashirin</surname> <given-names>V</given-names></name>, <name name-style="western"><surname>Sloot</surname> <given-names>P.</given-names></name> <article-title>The relative ineffectiveness of criminal network disruption</article-title>. <source><italic>Scientific Reports</italic></source> <year>2014</year>; <volume>4</volume>: <fpage>4238</fpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref021"><label>21</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Duxbury</surname> <given-names>SW</given-names></name>, <name name-style="western"><surname>Haynie</surname> <given-names>DL</given-names></name>. <article-title>Criminal Network Security: An Agent-based Approach to Evaluating Network Resilience</article-title>. <source>Criminology</source> <year>2019</year>; <volume>56</volume>: <fpage>314</fpage>–<lpage>342</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref022"><label>22</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>McGloin</surname> <given-names>JM</given-names></name>. <article-title>Policy Intervention and the Considerations of a Network Analysis of Street Gangs</article-title>. <source><italic>Criminology and Public Policy</italic></source> <year>2005</year>; <volume>4</volume>: <fpage>607</fpage>–<lpage>636</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref023"><label>23</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Diviak</surname> <given-names>T</given-names></name>, <name name-style="western"><surname>Dijstrak</surname> <given-names>JK</given-names></name>, <name name-style="western"><surname>Snijders</surname> <given-names>TAB</given-names></name>. <article-title>Structure, Multiplexity, and Centrality in a Corruption Network: The Czech Rath Affair</article-title>. <source><italic>Trends in Organized Crime</italic></source> <year>2019</year>; <volume>22</volume>: <fpage>274</fpage>–<lpage>297</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref024"><label>24</label><mixed-citation publication-type="book" xlink:type="simple"><name name-style="western"><surname>Papachristos</surname> <given-names>AV</given-names></name>, <name name-style="western"><surname>Smith</surname> <given-names>CM</given-names></name>. <source>The Embedded and Multiplex Nature of Al Capone</source>. In <name name-style="western"><surname>Morselli</surname> <given-names>C.</given-names></name> editor. <publisher-name>Crime and Networks</publisher-name>, <publisher-loc>Routledge: New York</publisher-loc>; <year>2013</year>. Pp. <fpage>97</fpage>–<lpage>115</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref025"><label>25</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Natarajan</surname> <given-names>M.</given-names></name> <article-title>Understanding the Structure of a Large Heroin Distribution Network: A Quantitative Analysis of Qualitative Data</article-title>. <source><italic>Journal of Quantitative Criminology</italic></source> <year>2006</year>; <volume>22</volume> <fpage>171</fpage>–<lpage>192</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref026"><label>26</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Soska</surname> <given-names>K</given-names></name>, <name name-style="western"><surname>Christin</surname> <given-names>N.</given-names></name> <article-title>Measuring the longitudinal evolution of the online anonymous marketplace ecosystem</article-title>. <source><italic>Proceedings of the 24</italic><sup><italic>th</italic></sup> <italic>Usenix Security Symposium</italic></source> <year>2015</year>; <fpage>33</fpage>–<lpage>47</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref027"><label>27</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Barratt</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Lenton</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Maddox</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Allen</surname> <given-names>M.</given-names></name> <article-title>What if you live on top of a bakery and you like cakes? Drug use and harm trajectories before, during, and after the emergence of the <italic>Silk Road</italic></article-title>. <source><italic>International Journal of Drug Policy</italic></source> <year>2016</year>; <volume>35</volume>: <fpage>50</fpage>–<lpage>57</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref028"><label>28</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Aldridge</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Stevens</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Barratt</surname> <given-names>MJ</given-names></name>. <article-title>Will the growth in cryptomarket drug buying increase the harms of illicit drugs?</article-title> <source><italic>Addiction</italic></source> <year>2017</year>; <volume>113</volume>: <fpage>789</fpage>–<lpage>796</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref029"><label>29</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Martin</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Cunliffe</surname> <given-names>J</given-names></name>, <name name-style="western"><surname>Decary-Hetu</surname> <given-names>D</given-names></name>, <name name-style="western"><surname>Aldridge</surname> <given-names>J.</given-names></name> <article-title>Effect of restricting the legal supply of prescription opioids on buying through online illicit marketplaces: Interrupted time series analysis</article-title>. <source><italic>British Medical Journal</italic></source> <year>2018</year>; <volume>361</volume>.</mixed-citation></ref>
<ref id="pone.0238019.ref030"><label>30</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>adams</surname> <given-names>j</given-names></name>, <name name-style="western"><surname>Schaefer</surname> <given-names>DR</given-names></name>. <article-title>How initial prevalence moderates network-based smoking change: Estimating contextual effects with stochastic actor-based models.</article-title> <source><italic>Journal of Health and Social Behavior</italic></source> <year>2016</year>; <volume>57</volume>: <fpage>22</fpage>–<lpage>38</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref031"><label>31</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Schaefer</surname> <given-names>DR</given-names></name>, <name name-style="western"><surname>adams</surname> <given-names>j</given-names></name>, <name name-style="western"><surname>Haas</surname> <given-names>SA</given-names></name>. <article-title>Social Networks and Smoking: Exploring the Effects of Peer Influence and Smoker Popularity through Smoking Simulations</article-title>. <source><italic>Health Education and Behavior</italic></source> <year>2013</year>; <volume>40</volume>: <fpage>24</fpage>–<lpage>32</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref032"><label>32</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Snijders</surname> <given-names>TAB</given-names></name>., <name name-style="western"><surname>Steglich</surname> <given-names>CEG</given-names></name>. <article-title>Representing Micro-Macro Linkages by Actor- Based Dynamic Network Models</article-title>. <source><italic>Sociological Methods and Research</italic></source> <year>2015</year>; <volume>44</volume>: <fpage>222</fpage>–<lpage>271</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref033"><label>33</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Caulkins</surname> <given-names>JP</given-names></name>, <name name-style="western"><surname>Reuter</surname> <given-names>P.</given-names></name> <article-title>How drug enforcement affects drug prices</article-title>. <source><italic>Crime and Justice</italic></source> <year>2010</year>; <volume>39</volume>: <fpage>213</fpage>–<lpage>271</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref034"><label>34</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Bail</surname> <given-names>CA</given-names></name>, <name name-style="western"><surname>Argyle</surname> <given-names>LP</given-names></name>, <name name-style="western"><surname>Brown</surname> <given-names>TW</given-names></name>, <name name-style="western"><surname>Bumpus</surname> <given-names>JP</given-names></name>, <name name-style="western"><surname>Chen</surname> <given-names>H</given-names></name>, <name name-style="western"><surname>Lee</surname> <given-names>J</given-names></name>, <etal>et al</etal>. <article-title>Exposure to opposing views on social media can increase political polarization</article-title>. <source><italic>Proceedings of the National Academy of Sciences</italic></source> <year>2018</year>; <volume>115</volume>: <fpage>9216</fpage>–<lpage>9221</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref035"><label>35</label><mixed-citation publication-type="book" xlink:type="simple"><name name-style="western"><surname>Liu</surname> <given-names>B.</given-names></name> <source><italic>Sentiment Analysis and Opinion Mining</italic></source>. <publisher-name>Morgan &amp; Taylor</publisher-name>; <year>2012</year>.</mixed-citation></ref>
<ref id="pone.0238019.ref036"><label>36</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Clauset</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Shalizi</surname> <given-names>CR</given-names></name>, <name name-style="western"><surname>Newman</surname> <given-names>MEJ</given-names></name>. <article-title>Power-law distribution in empirical data</article-title>. <source><italic>SIAM Review</italic></source> <year>2009</year>; <volume>51</volume>: <fpage>661</fpage>–<lpage>703</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref037"><label>37</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Barabasi</surname> <given-names>AL</given-names></name>, <name name-style="western"><surname>Albert</surname> <given-names>R.</given-names></name> <article-title>Emergence of Scaling in Random Networks</article-title>. <source><italic>Science</italic></source> <year>1999</year>; <volume>286</volume>: <fpage>509</fpage>–<lpage>512</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref038"><label>38</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Gallo</surname> <given-names>E</given-names></name>, <name name-style="western"><surname>Yan</surname> <given-names>C.</given-names></name> <article-title>The effects of reputational and social knowledge on cooperation</article-title>. <source><italic>Proceedings of the National Academy of Sciences</italic></source> <year>2015</year>; <volume>112</volume>: <fpage>3647</fpage>–<lpage>3652</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref039"><label>39</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Lazer</surname> <given-names>D</given-names></name>, <name name-style="western"><surname>Pentland</surname> <given-names>A</given-names></name>, <name name-style="western"><surname>Adamic</surname> <given-names>L</given-names></name>, <name name-style="western"><surname>Aral</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Barabasi</surname> <given-names>AL</given-names></name>, <name name-style="western"><surname>Brewer</surname> <given-names>D</given-names></name>, <etal>et al</etal>. <source>Computational Social Science. <italic>Science</italic></source> <year>2009</year>; <volume>323</volume>:<fpage>721</fpage>–<lpage>723</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref040"><label>40</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Snijders</surname> <given-names>TAB</given-names></name>. <article-title>Stochastic actor-oriented models for network dynamics</article-title>. <source><italic>Annual Review of Statistics and Its Application</italic></source> <year>2017</year>; <volume>4</volume>: <fpage>343</fpage>–<lpage>363</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref041"><label>41</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Bornabeau</surname> <given-names>E.</given-names></name> <article-title>Agent-based modeling: Methods and techniques for simulating human systems</article-title>. <source><italic>Proceedings of the National Academy of Sciences</italic></source> <year>2002</year>; <volume>99</volume>: <fpage>7280</fpage>–<lpage>7297</lpage>.</mixed-citation></ref>
<ref id="pone.0238019.ref042"><label>42</label><mixed-citation publication-type="book" xlink:type="simple"><name name-style="western"><surname>Gilbert</surname> <given-names>N</given-names></name>, <name name-style="western"><surname>Troitzsch</surname> <given-names>KG</given-names></name>. <source><italic>Simulation for the Social Scientist</italic></source>. <publisher-name>Open University Press</publisher-name>; <year>2005</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>