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
Journal ArticleDOI
Effects of time horizons on influence maximization in the voter dynamics
TL;DR: In this article, the influence maximization in the voter model with an active strategic and a passive influencing party in non-stationary settings is analyzed, and the dependence of optimal influence allocation on the time horizons of the strategic influencer is explored.
Posted Content
Adaptive Social Learning
TL;DR: This work proposes an Adaptive Social Learning (ASL) strategy, which relies on a small step-size parameter to tune the adaptation degree, and establishes that the ASL strategy achieves consistent learning under standard global identifiability assumptions.
Posted Content
Maximizing Diversity of Opinion in Social Networks
Erika Mackin,Stacy Patterson +1 more
TL;DR: In this article, the authors study the problem of maximizing opinion diversity in a social network that includes opinion leaders with binary opposing opinions, and they give analytical solutions to these problems for paths, cycles, and trees.
Posted Content
Opinion Dynamics with Random Actions and a Stubborn Agent
TL;DR: A recent extension of the DeGroot model, in which the opinion of each agent is a random Bernoulli distributed variable, is considered, and it is established that this model also leads to consensus, in the sense of convergence in probability, inThe presence of a stubborn agent.
Book ChapterDOI
Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise
TL;DR: In this paper , the authors study the 3-Majority dynamics, an opinion dynamics which has been proved to be an efficient protocol for the majority consensus problem, in which they introduce a simple feature of uniform communication noise, following (d'Amore et al. 2020).
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.