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
Proceedings ArticleDOI
Belief control strategies for interactions over weak graphs
Hawraa Salami,Ali H. Sayed +1 more
TL;DR: In this paper, the authors characterize the set of beliefs that can be imposed on non-influential agents and how the graph topology of these latter agents helps resist manipulation but only to a certain degree.
Journal ArticleDOI
How Opinion Leaders Affect Others on Seeking Truth in a Bounded Confidence Model
TL;DR: Simulations show that increasing the appeal of the leader whose opinion is opposite to the truth has a straightforward impact, i.e., it normally prevents the agents from finding the truth.
Proceedings ArticleDOI
Minimizing Tension in Teams
Behzad Golshan,Evimaria Terzi +1 more
TL;DR: Although it is shown that k- AlterHabit is NP-hard, the authors devise polynomial-time algorithms for solving it in practice and demonstrate both the efficiency and the efficacy of the algorithmic techniques on a collection of real data.
Proceedings ArticleDOI
On the Complexity of Opinions and Online Discussions
TL;DR: A modeling framework is presented to construct latent representations of opinions in online discussions which are consistent with human judgments, as measured by online voting, and establishes a surprising connection between opinion and voting models and the sign-rank of matrices.
Posted Content
The harmonic influence in social networks and its distributed computation by message passing.
TL;DR: A distributed message passing algorithm that aims to compute the nodes' influence and the proof of convergence is detailed, which greatly extends previous results in the literature and provides simulations that illustrate the usefulness of the returned approximation.
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.