The strange man in random networks of automata

We have performed computer simulations of Kauffman’s automata on several graphs, such as the regular square lattice and invasion percolation clusters, in order to investigate phase transitions, radial distributions of the mean total damage (dynamical exponent) and propagation speeds of the damage when one adds a damaging agent, nicknamed “strange man”. Despite the increase in the damaging efficiency, we have not observed any appreciable change of the transition threshold to chaos neither for the short-range nor for the small-world case on the square lattices when the strange man is added, in comparison to when small initial damages are inserted in the system. Particularly, we have checked the damage spreading when some connections are removed on the square lattice and when one considers special invasion percolation clusters (high boundary-saturation clusters). It is seen that the propagation speed in these systems is quite sensible to the degree of dilution on the square lattice and to the degree of saturation on invasion percolation clusters.