Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
From MaRDI portal
(Redirected from Publication:737177)
Abstract: In majority dynamics, agents located at the vertices of an undirected simple graph update their binary opinions synchronously by adopting those of the majority of their neighbors. On infinite unimodular transitive graphs (e.g., Cayley graphs), when initial opinions are chosen from a distribution that is invariant with respect to the graph automorphism group, we show that the opinion of each agent almost surely either converges, or else eventually oscillates with period two; this is known to hold for finite graphs, but not for all infinite graphs. On ErdH{o}s-R'enyi random graphs with degrees , we show that when initial opinions are chosen i.i.d. then agents all converge to the initial majority opinion, with constant probability. Conversely, on random 4-regular finite graphs, we show that with high probability different agents converge to different opinions.
Recommendations
Cites work
- Analysis of Boolean Functions
- Automorphism groups of graphs as topological groups
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- scientific article; zbMATH DE number 1452975 (Why is no real title available?)
- Majority dynamics and the retention of information
- Majority dynamics on trees and the dynamic cavity method
- Negative Moments of Positive Random Variables
- On the Period-Two-Property of the Majority Operator in Infinite Graphs
- Percolation on finite graphs and isoperimetric inequalities.
- Periodic behaviour of generalized threshold functions
- Probability on trees and networks
- Processes on unimodular random networks
- Recurrence of distributional limits of finite planar graphs
- Spectral norm of random matrices
- The majority action on infinite graphs: Strings and puppets
- Uniform infinite planar triangulations
Cited in
(32)- Opinion dynamics using majority functions
- Coarsening model on \({\mathbb{Z}^{d}}\) with biased zero-energy flips and an exponential large deviation bound for ASEP
- The majority action on infinite graphs: Strings and puppets
- Phase transition of the 2-choices dynamics on core-periphery networks
- A note on the majority dynamics in inhomogeneous random graphs
- Best response dynamics on random graphs
- Majority dynamics and the median process: connections, convergence and some new conjectures
- Percolation in majority dynamics
- The majority vote process and other consensus processes on trees
- Majority dynamics and the retention of information
- Swarming on random graphs
- Central limit theorem for majority dynamics: bribing three voters suffices
- Agreement dynamics on directed random graphs
- Resolution of a conjecture on majority dynamics: rapid stabilization in dense random graphs
- scientific article; zbMATH DE number 1795899 (Why is no real title available?)
- Convergence, stability, and robustness of multidimensional opinion dynamics in continuous time
- Consensus of interacting particle systems on Erdős-Rényi graphs
- Lifting majority to unanimity in opinion diffusion
- Majority dynamics with one nonconformist
- Majority dynamics on sparse random graphs
- scientific article; zbMATH DE number 7758322 (Why is no real title available?)
- Phase transition of the k-majority dynamics in biased communication models
- Majority vote in social networks
- Quasi-majority functional voting on expander graphs
- Partitioning problems via random processes
- Granular degroot dynamics -- a model for robust naive learning in social networks
- Quasi-majority functional voting on expander graphs
- Asynchronous majority dynamics on binomial random graphs
- Majority dynamics on random graphs: the multiple states case
- Majority dynamics: the power of one
- The ``power of few phenomenon: the sparse case
- Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available
This page was built for publication: Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q737177)
