Agreement dynamics on directed random graphs
Abstract
We examine some agreement-dynamics models that are placed on directed random graphs. In such systems a fraction of sites , where is the average degree, becomes permanently fixed or flickering. In the Voter model, which has no surface tension, such zealots or flickers freely spread their opinions and that makes the system disordered. For models with a surface tension, like the Ising model or the Naming Game model, their role is limited and such systems are ordered at large~. However, when decreases, the density of zealots or flickers increases, and below a certain threshold () the system becomes disordered. On undirected random graphs agreement dynamics is much different and ordering appears as soon the graph is above the percolation threshold at .
Cite
@article{arxiv.1605.00310,
title = {Agreement dynamics on directed random graphs},
author = {Adam Lipowski and Dorota Lipowska and Antonio L. Ferreira},
journal= {arXiv preprint arXiv:1605.00310},
year = {2017}
}
Comments
7 pages, J. Stat. Mech. (in press)