Agreement dynamics on directed random graphs
Adam Lipowski, Dorota Lipowska, Antonio L. Ferreira

TL;DR
This paper studies how agreement dynamics behave on directed random graphs, revealing how the presence of fixed or flickering sites affects order and disorder depending on the average degree, with different behaviors compared to undirected graphs.
Contribution
It analyzes agreement models on directed random graphs, highlighting the impact of zealots and flickers on system ordering and identifying critical thresholds for disorder.
Findings
Zealots or flickers become prevalent below z~2, leading to disorder.
Directed graphs exhibit a higher threshold for ordering compared to undirected graphs.
Order emerges at z>1 in undirected graphs, but at z~2 in directed 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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
