Activity patterns on random scale-free networks: Global dynamics arising from local majority rules
摘要
Activity or spin patterns on random scale-free network are studied by mean field analysis and computer simulations. These activity patterns evolve in time according to local majority-rule dynamics which is implemented using (i) parallel or synchronous updating and (ii) random sequential or asynchronous updating. Our mean-field calculations predict that the relaxation processes of disordered activity patterns become much more efficient as the scaling exponent of the scale-free degree distribution changes from to . For , the corresponding decay times increase as with increasing network size whereas they are independent of for . In order to check these mean field predictions, extensive simulations of the pattern dynamics have been performed using two different ensembles of random scale-free networks: (A) multi-networks as generated by the configuration method, which typically leads to many self-connections and multiple edges, and (B) simple-networks without self-connections and multiple edges.
引用
@article{arxiv.cond-mat/0701432,
title = {Activity patterns on random scale-free networks: Global dynamics arising from local majority rules},
author = {Haijun Zhou and Reinhard Lipowsky},
journal= {arXiv preprint arXiv:cond-mat/0701432},
year = {2007}
}
备注
20 pages, 8 figures