Agreement dynamics on directed random graphs
From MaRDI portal
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 .
Recommendations
- Agreement over random networks
- Agreement dynamics on interaction networks with diverse topologies
- Deterministic versus stochastic consensus dynamics on graphs
- Consensus dynamics on random rectangular graphs
- Diffusion and consensus on weakly connected directed graphs
- Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
- Consensus of interacting particle systems on Erdős-Rényi graphs
- Optimal agreement in a scale-free network environment
Cites work
- Conservation laws for voter-like models on random directed networks
- How can statistical mechanics contribute to social science?
- scientific article; zbMATH DE number 1277441 (Why is no real title available?)
- scientific article; zbMATH DE number 1350307 (Why is no real title available?)
- On the role of zealotry in the voter model
- Opinion control in complex networks
- Sharp transition towards shared vocabularies in multi-agent systems
- Statistical mechanics of complex networks
- Universality classes in nonequilibrium lattice systems
- Zero-temperature dynamics for the ferromagnetic Ising model on random graphs
Cited in
(2)
This page was built for publication: Agreement dynamics on directed random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303097)