For a two-opinion preferential-attachment network with multiple sampling and general reinforcement, the normalized opinion count, influence capital and activity converge almost surely to invariant sets of a mean-field ODE, provided a fixed-point root is unique.
Reaching Consensus via non-Bayesian Asynchronous Learning in Social Networks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We study the outcomes of information aggregation in online social networks. Our main result is that networks with certain realistic structural properties avoid information cascades and enable a population to effectively aggregate information. In our model, each individual in a network holds a private, independent opinion about a product or idea, biased toward a ground truth. Individuals declare their opinions asynchronously, can observe the stated opinions of their neighbors, and are free to update their declarations over time. Supposing that individuals conform with the majority report of their neighbors, we ask whether the population will eventually arrive at consensus on the ground truth. We show that the answer depends on the network structure: there exist networks for which consensus is unlikely, or for which declarations converge on the incorrect opinion with positive probability. On the other hand, we prove that for networks that are sparse and expansive, the population will converge to the correct opinion with high probability.
citation-role summary
citation-polarity summary
fields
math.PR 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A model of opinion dynamics evolving via a preferential attachment mechanism involving multiple extractions
For a two-opinion preferential-attachment network with multiple sampling and general reinforcement, the normalized opinion count, influence capital and activity converge almost surely to invariant sets of a mean-field ODE, provided a fixed-point root is unique.