The current paper aimed to investigate the effectiveness of five law enforcement interventions in disrupting and dismantling criminal networks. We tested three law enforcement interventions that targeted social capital in criminal networks (betweenness, degree and cut-set) and two interventions that targeted human capital (actors who possess money and those who possess precursor chemicals). These five interventions are compared with each other and with random (opportunistic) removal of actors in two settings: (i) with network adaptation incorporated into the simulations and (ii) without network adaptation. Results illustrate that the removal of actors based on betweenness centrality was the most efficient strategy, leading to network disruption in the least number of steps and was relatively consistent across replications. Targeting actors who possessed money was the second most effective overall and was also relatively consistent in its disruptive effect.
An $n\times n$ sign pattern $\mathcal{A}$ is spectrally arbitrary if given any self-conjugate spectrum there exists a matrix realization of $\mathcal{A}$ with that spectrum. If replacing any nonzero entry of $\mathcal{A}$ by zero destroys this property, then $\mathcal{A}$ is a minimal spectrally arbitrary sign pattern. Several families of sign patterns are presented that, for all $n\geq 3$, each contain an $n\times n$ minimal spectrally arbitrary sign pattern. These are the first families proven to have this property, and they improve previously known results. Furthermore, all $3\times 3$ minimal spectrally arbitrary sign patterns are determined, it is proved that any irreducible $n\times n$ spectrally arbitrary sign pattern must have at least $2n-1$ nonzero entries, and it is conjectured that the minimum number of nonzero entries is $2n$.
It is proved that the set of higher weight enumerators of a linear code over a finite field is equivalent to the Tutte polynomial associated to the code. An explicit expression for the Tutte polynomial is given in terms of the subcode weights. Generalizations of these results are proved and are applied to codeword m-tuples. These general results are used to prove a very general MacWilliams-type identity for linear codes that generalizes most previous extensions of the MacWilliams identity. In addition, a general and very useful matrix framework for manipulating weight and support enumerators of linear codes is presented.