Asynchronous majority dynamics in preferential attachment trees
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
- Bayesian learning in social networks
- Bayesian learning in social networks.
- Detection Performance of the Majority Dominance Rule in m -Ary Relay Trees With Node and Link Failures
- Emergence of Scaling in Random Networks
- Ergodic theorems for weakly interacting infinite systems and the voter model
- Informational externalities and emergence of consensus
- Local majority dynamics on preferential attachment graphs
- Majority dynamics on trees and the dynamic cavity method
- Nearly-tight analysis for 2-choice and 3-majority consensus dynamics
- Pathological Outcomes of Observational Learning
- Reaching a Consensus
- Reaching consensus via non-Bayesian asynchronous learning in social networks
- Stabilizing Consensus with Many Opinions
- The degree sequence of a scale-free random graph process
- The diameter of a scale-free random graph
- 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 in preferential attachment trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842572)
