revolutionaries, along the model favoured historically by a number of insurgent organisations. A node that acquires a high vertex order splits itself into $n$ nodes, all linked with each other, with the previous outside connections split uniformly between them. In graph-theoretic language, each supernode is a clique.

As in ring formation, a node that considers itself vulnerable is allowed to split itself into a clique of nodes. The new nodes are drawn either from the pool of new nodes, or, if they are insufficient, from low-vertex-order neighbours of the clique-forming node. As before, this node’s external edges are distributed uniformly among members, while other member nodes’ former external edges are deleted.

### Simulations – first set

For our first set of simulations, we consider a scalefree network of $N$ = 400 nodes. We use a Barabási-Albert network created by the following algorithm:

1.  [*Growth:*]{} Starting with $m_{0}$ = 40 nodes, at each round we add $m$ = 10 new nodes, each with 3 edges.

2.  [*Preferential Attachment:*]{} The probability that a new node connects to node $i$ is $\Pi(k_{i})$ = $k_{i}/\sum_{j}k_{j}$ where $k_{i}$ is the degree of node $i$.

Having created the scalefree network, we then ran each of the 