Stationary States of a Random Copying Mechanism over a Complex Networks
arXiv:cond-mat/0411295 · doi:10.1016/j.physa.2005.01.035
Abstract
An analytical approach to network dynamics is used to show that when agents copy their state randomly the network arrives to a stationary status in which the distribution of states is independent of the agents degree. The effects of network topology on the process are characterized introducing a quantity called influence and studying its behavior for scale-free and random networks. We show that for this model degree averaged means are constant in time regardless of the number of states involved.
arXiv comment11 pages, 3 Figures, article class
References in corpus (18)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Community structure in social and biological networks
- Error and attack tolerance of complex networks
- Epidemic spreading in scale-free networks
- Assortative mixing in networks
- Classes of behavior of small-world networks
- Why social networks are different from other types of networks
- Community Structure in Jazz
- Epidemic dynamics in finite size scale-free networks
- Halting viruses in scale-free networks
- Information Flow in Social Groups
- Epidemic Incidence in Correlated Complex Networks
- Analytical results for the Sznajd model of opinion formation
- Opinion Formation on a Deterministic Pseudo-fractal Network
- Simulation of Consensus Model of Deffuant et al on a Barabasi-Albert Network
- Monte Carlo simulations of the Ising and the Sznajd model on growing Barabasi - Albert networks
- Minorities in a model for opinion formation