Asynchronous majority dynamics on binomial random graphs
From MaRDI portal
Cites work
- A general framework for rational learning in social networks
- A model for spatial conflict
- A polylogarithmic gossip algorithm for plurality consensus
- Asymptotic learning on Bayesian social networks
- Asynchronous majority dynamics in preferential attachment trees
- Bayesian learning in social networks
- Bayesian learning in social networks.
- Biased opinion dynamics: when the devil is in the details
- Complex graphs and networks
- Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
- Ergodic theorems for weakly interacting infinite systems and the voter model
- Global majority consensus by local majority polling on graphs of a given degree sequence
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- Informational externalities and emergence of consensus
- Introduction to Random Graphs
- Majority dynamics on sparse random graphs
- Majority dynamics on trees and the dynamic cavity method
- Majority model on random regular graphs
- Nearly-tight analysis for 2-choice and 3-majority consensus dynamics
- Observational learning under imperfect information
- Opinion forming in Erdős-Rényi random graph and expanders
- Pathological Outcomes of Observational Learning
- Random graphs.
- Reaching a Consensus
- Reaching consensus via non-Bayesian asynchronous learning in social networks
- Resolution of a conjecture on majority dynamics: rapid stabilization in dense random graphs
- Stabilizing Consensus with Many Opinions
- Word-of-mouth learning.
- Zero-temperature ising spin dynamics on the homogeneous tree of degree three
This page was built for publication: Asynchronous majority dynamics on binomial random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920841)
