scispace - formally typeset
Journal ArticleDOI

Binary Opinion Dynamics with Stubborn Agents

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

Maximizing Influence of Leaders in Social Networks

TL;DR: In this article, the edge addition problem for the DeGroot model of opinion dynamics in a social network with n nodes and m edges, in the presence of a small number s 0, where O (⋅) notation suppresses the poly (log n) factors, is considered.
Journal ArticleDOI

Do zealots increase or decrease the polarization of social networks

TL;DR: It is shown that zealots are effective only when they are chosen uniformly randomly in the network, and the random initial conditions are used, and that increasing zealots' fraction does not make any substantial change in the polarization values.
Proceedings ArticleDOI

Optimal Multiphase Investment Strategies for Influencing Opinions in a Social Network

TL;DR: The problem of optimally investing in nodes of a social network in a competitive setting, where two camps aim to maximize adoption of their opinions by the population, is studied and the existence of Nash equilibria under reasonable assumptions is shown.
Journal ArticleDOI

Uncertain Opinion Evolution with Bounded Confidence Effects in Social Networks

TL;DR: In this paper, the authors investigated uncertain opinion evolution with bounded confidence effects in social networks by theoretical demonstration and numerical examples analyses, and experiments simulations analyses and showed that the average widths of uncertain opinions are always smaller than the maximum opinion width of all the initial opinions among agents.
Journal ArticleDOI

Noisy bounded confidence models for opinion dynamics: the effect of boundary conditions on phase transitions

TL;DR: In this paper, SDE and PDE models for opinion dynamics under bounded confidence were compared for a range of different boundary conditions, with and without the inclusion of a radical population.
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.
Related Papers (5)