Majority dynamics on trees and the dynamic cavity method
From MaRDI portal
best response dynamicsconsensusdynamic cavity methodIsing spin dynamicsmajority dynamicsparallel/synchronous dynamicssocial learningtrees
Trees (05C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Interacting particle systems in time-dependent statistical mechanics (82C22) Cooperative games (91A12) Rationality and learning in game theory (91A26) Mathematical sociology (including anthropology) (91D99) Decentralized systems (93A14)
Abstract: A voter sits on each vertex of an infinite tree of degree , and has to decide between two alternative opinions. At each time step, each voter switches to the opinion of the majority of her neighbors. We analyze this majority process when opinions are initialized to independent and identically distributed random variables. In particular, we bound the threshold value of the initial bias such that the process converges to consensus. In order to prove an upper bound, we characterize the process of a single node in the large -limit. This approach is inspired by the theory of mean field spin-glass and can potentially be generalized to a wider class of models. We also derive a lower bound that is nontrivial for small, odd values of .
Recommendations
- The majority vote process and other consensus processes on trees
- Voter and majority dynamics with biased and stubborn agents
- Central limit theorem for majority dynamics: bribing three voters suffices
- Majority dynamics and the retention of information
- Majority dynamics and the median process: connections, convergence and some new conjectures
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- An elementary proof of the local central limit theorem
- Bootstrap percolation on homogeneous trees has 2 phase transitions
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Cascading behavior in networks: algorithmic and economic issues
- Contagion
- Counting independent sets up to the tree threshold
- Cugliandolo-Kurchan equations for dynamics of spin-glasses
- Expander graphs and their applications
- Gibbs measures and phase transitions
- Gibbs measures and phase transitions on sparse random graphs
- Glauber dynamics on trees and hyperbolic graphs
- Glauber dynamics on trees: Boundary conditions and mixing time
- scientific article; zbMATH DE number 3517666 (Why is no real title available?)
- scientific article; zbMATH DE number 3638870 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 1952026 (Why is no real title available?)
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- Information, Physics, and Computation
- Learning from Neighbours
- Parallel dynamics of disordered Ising spin systems on finitely connected random graphs
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Periodic behaviour of generalized threshold functions
- Phase ordering after a deep quench: the stochastic Ising and hard core gas models on a tree
- Reaching a Consensus
- Spin glasses and Stein's method
- Stretched exponential fixation in stochastic Ising models at zero temperature
- The problem of uniqueness of a Gibbsian random field and the problem of phase transitions
- Zero-temperature ising spin dynamics on the homogeneous tree of degree three
Cited in
(33)- Opinion dynamics using majority functions
- The consensus times of the majority vote process on a torus
- Phase transition of the 2-choices dynamics on core-periphery networks
- A note on the majority dynamics in inhomogeneous random graphs
- On the spread of influence in graphs
- Power of the crowd
- Majority dynamics and the median process: connections, convergence and some new conjectures
- Zero-temperature Glauber dynamics on the 3-regular tree and the median process
- Threshold behavior of bootstrap percolation
- The majority vote process and other consensus processes on trees
- Opinion forming in Erdős-Rényi random graph and expanders
- Dynamic matching pennies on networks
- Majority dynamics and the retention of information
- Stochastic dynamics on hypergraphs and the spatial majority rule model
- Voter and majority dynamics with biased and stubborn agents
- Central limit theorem for majority dynamics: bribing three voters suffices
- Fixation to consensus on tree-related graphs
- Improved intolerance intervals and size bounds for a Schelling-type spin system
- scientific article; zbMATH DE number 2080927 (Why is no real title available?)
- Probabilistic consensus via polling and majority rules
- Majority dynamics with one nonconformist
- Opinion Forming in Erdös-Rényi Random Graph and Expanders
- The matrix product approximation for the dynamic cavity method
- Brief announcement: Phase transitions of the k-majority dynamics in a biased communication model
- Non-reversible stationary states for majority voter and Ising dynamics on trees
- Asynchronous majority dynamics in preferential attachment trees
- Mean-field Potts and random-cluster dynamics from high-entropy initializations
- Asynchronous majority dynamics on binomial random graphs
- Gaussian approximation of dynamic cavity equations for linearly-coupled stochastic dynamics
- Phase transitions in biased opinion dynamics with 2-choices rule
- A model of opinion dynamics evolving via a preferential attachment mechanism involving multiple extractions
- Marginal dynamics of probabilistic cellular automata on trees
- Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
This page was built for publication: Majority dynamics on trees and the dynamic cavity method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655579)
