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
The Evolution of Beliefs over Signed Social Networks
TL;DR: A no-survivor theorem is established, stating that the difference in opinions of any two nodes diverges whenever opinions in the network diverge as a whole, and a live-or-die lemma is proved, indicating that almost surely, the opinions either converge to an agreement or diverge.
Journal ArticleDOI
Multiagent Interval Consensus With Flocking Dynamics
TL;DR: In this paper , the authors investigate the interval consensus for a network of agents with flocking dynamics, i.e., second-order multiagent systems, where each agent imposes an interval constraint on its preferred consensus values, with the aim of driving the agent into a favorable interval.
Journal ArticleDOI
Ranking Online Social Users by their Influence
TL;DR: Zhang et al. as mentioned in this paper introduced an original mathematical model to analyse the diffusion of posts within a generic online social platform, where each user is not simply considered as a node on the social graph, but is further equipped with his/her own Wall and Newsfeed, and has his own individual self posting and re-posting activity.
Proceedings ArticleDOI
Opinion Dynamics with Random Actions and a Stubborn Agent
TL;DR: In this article, the authors consider the case of a stubborn agent and show that the DeGroot model can still lead to consensus in the presence of such an agent, even with weaker assumptions.
Journal ArticleDOI
Shadowing and shielding: Effective heuristics for continuous influence maximisation in the voting dynamics.
TL;DR: In this article, the authors study the generalised problem of continuous influence maximization where nodes can be targeted with flexible intensity and compare the structure of the solutions in the continuous and discrete regimes.
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.