Static Pairwise Annihilation in Complex Networks
arXiv:cond-mat/0504695 · doi:10.1103/PhysRevE.72.026102
Abstract
We study static annihilation on complex networks, in which pairs of connected particles annihilate at a constant rate during time. Through a mean-field formalism, we compute the temporal evolution of the distribution of surviving sites with an arbitrary number of connections. This general formalism, which is exact for disordered networks, is applied to Kronecker, Erdös-Rényi (i.e. Poisson) and scale-free networks. We compare our theoretical results with extensive numerical simulations obtaining excellent agreement. Although the mean-field approach applies in an exact way neither to ordered lattices nor to small-world networks, it qualitatively describes the annihilation dynamics in such structures. Our results indicate that the higher the connectivity of a given network element, the faster it annihilates. This fact has dramatic consequences in scale-free networks, for which, once the ``hubs'' have been annihilated, the network disintegrates and only isolated sites are left.
arXiv comment7 Figures, 10 pages
References in corpus (16)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Novel type of phase transition in a system of self-driven particles
- Error and attack tolerance of complex networks
- Epidemic spreading in scale-free networks
- Evolution of networks
- Small world effect in an epidemiological model
- Exact solution of site and bond percolation on small-world networks
- Ising model in small-world networks
- Random walk and trapping processes on scale-free networks
- Replicated Transfer Matrix Analysis of Ising Spin Models on `Small World' Lattices
- Vector opinion dynamics in a model for social influence
- White Dwarfs Near Black Holes: A New Paradigm for Type I Supernovae
- Two-Scale Annihilation
- Alternating Kinetics of Annihilating Random Walks Near a Free Interface
- Random Walks on Complex Networks