above defensive strategies against a vertex-order attack.

### Results

The results of the initial three simulations are given in Figure \[fig:BA01\].

\[hbtp\] ![Vertex order decapitation attack in rings, cliques and with no adaptation[]{data-label="fig:BA01"}](vertex-order-attack-rings-cliques.eps "fig:")

The red graph in Figure \[fig:BA01\] provides a calibration baseline. As seen in the above section, random replenishment without adaptation is ineffective: within three rounds the size of the largest connected component has fallen by a half, from 400 nodes to well under 200.

The green graph shows that rings give only a surprisingly short-term defence benefit. They postpone network collapse from about two rounds qto about a dozen rounds. Thereafter, the network is almost completely disconnected. In fact, the outcome is even worse than with random replenishment.

Cliques, on the other hand, work well. A few vertices are disconnected at each attack round, but as the cyan graph shows, the network itself remains robustly connected. This may provide some insight into why, although rings have seemed attractive to theoreticians, those real revolutionary movements that have left some trace in the history books have used a cell structure instead.

Attack Evolution – First Round
==============================

Having tried a number of defence strategies and found that one 