Worm propagation and defense over hyperbolic graphs

We investigate the speed of propagation of worms on the so-called δ-hyperbolic graphs, as defined by Gromov. Such graphs as the physical graph and the logical mail graph manifest this property. The Cayley graphs of combinatorial group theory are used as prototypes of hyperbolic graphs. A simple mail worm defense strategy is considered and the issue as to whether it is able to slow the propagation is addressed.