Journal ArticleDOI
Binary Opinion Dynamics with Stubborn Agents
Ercan Yildiz,Asuman Ozdaglar,Daron Acemoglu,Amin Saberi,Anna Scaglione +4 more
- Vol. 1, Iss: 4, pp 19
Reads0
Chats0
TLDR
It is shown that the presence of stubborn agents with opposing opinions precludes convergence to consensus; instead, opinions converge in distribution with disagreement and fluctuations.Abstract:
We study binary opinion dynamics in a social network with stubborn agents who influence others but do not change their opinions. We focus on a generalization of the classical voter model by introducing nodes (stubborn agents) that have a fixed state. We show that the presence of stubborn agents with opposing opinions precludes convergence to consensus; instead, opinions converge in distribution with disagreement and fluctuations. In addition to the first moment of this distribution typically studied in the literature, we study the behavior of the second moment in terms of network properties and the opinions and locations of stubborn agents. We also study the problem of optimal placement of stubborn agents where the location of a fixed number of stubborn agents is chosen to have the maximum impact on the long-run expected opinions of agents.read more
Citations
More filters
Posted Content
Social Learning with Partial Information Sharing
TL;DR: In this article, the authors consider the case in which agents will only share their beliefs regarding one hypothesis of interest, with the purpose of evaluating its validity, and draw conditions under which this policy does not affect truth learning.
Posted Content
Dynamic competition over social networks
Antoine Mandel,Xavier Venel +1 more
TL;DR: The existence of the uniform value is proved: if the players are sufficiently patient, both players can guarantee the same mean-average opinion without knowing the exact discount factor.
Journal ArticleDOI
Polarization When People Choose Their Peers
Ugo Bolletta,Paolo Pin +1 more
TL;DR: A model where agents correct their heterogeneous initial opinion by averaging the opinions of their neighbors is developed and it is shown how each of these cases is tied to a key network statistic, the initial diameter.
Posted Content
Belief Control Strategies for Interactions over Weakly-Connected Graphs
TL;DR: This article develops mechanisms by which influential agents can lead receiving agents to adopt certain beliefs and examines whether receiving agents can be driven to arbitrary beliefs and whether the network structure limits the scope of control by the influential agents.
Journal ArticleDOI
Tracking Dynamics of Opinion Behaviors with a Content-Based Sequential Opinion Influence Model
TL;DR: A content-based sequential opinion influence framework is developed and two opinion sentiment prediction models with alternative prediction strategies are proposed and it is found that an individuals influence is correlated to her/his style of expressions.
References
More filters
Journal ArticleDOI
A Simple Model of Herd Behavior
TL;DR: In this article, the authors analyze a sequential decision model in which each decision maker looks at the decisions made by previous decision makers in taking her own decision, and they show that the decision rules that are chosen by optimizing individuals will be characterized by herd behavior.
Proceedings ArticleDOI
Maximizing the spread of influence through a social network
TL;DR: An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Journal ArticleDOI
A New Product Growth for Model Consumer Durables
TL;DR: A growth model for the timing of initial purchase of new products is developed and tested empirically against data for eleven consumer durables, and a long-range forecast is developed for the sales of color television sets.
Journal ArticleDOI
Maximizing the Spread of Influence through a Social Network
TL;DR: The problem of finding the most influential nodes in a social network is NP-hard as mentioned in this paper, and the first provable approximation guarantees for efficient algorithms were provided by Domingos et al. using an analysis framework based on submodular functions.
Book
Interacting Particle Systems
TL;DR: The construction, and other general results are given in this paper, with values in [0, ] s. The voter model, the contact process, the nearest-particle system, and the exclusion process.