Related papers: Undecided State Dynamics with Many Opinions
The massive amount of text data on the web has facilitated research on the quantitative analysis of public opinion, which could not be visualized earlier. In this paper, we propose a new opinion dynamics theory. This theory that is intended…
In the deterministic binary majority process we are given a simple graph where each node has one out of two initial opinions. In every round, every node adopts the majority opinion among its neighbors. By using a potential argument first…
We investigate the non-equilibrium dynamics of a three state kinetic exchange model of opinion formation, where switches between extreme states are possible, depending on the value of a parameter $q$. The mean field dynamical equations are…
We present a silent, self-stabilizing ranking protocol for the population protocol model of distributed computing, where agents interact in randomly chosen pairs to solve a common task. We are given $n$ anonymous agents, and the goal is to…
Consensus protocols play an important role in the study of distributed algorithms. In this paper, we study the effect of bias on two popular consensus protocols, namely, the {\em voter rule} and the {\em 2-choices rule} with binary…
We discuss two models of opinion dynamics. First wepresent a brief review of the Hegselmann and Krause (HK) compromise model in two dimensions, showing that it is possible to simulate the dynamics in the limit of an infinite number of…
Considerable effort using techniques developed in statistical physics has been aimed at numerical simulations of agent-based opinion models and analysis of their results. Such work has elucidated how various rules for interacting agents can…
This work introduces a Bayesian framework that unifies a wide class of opinion dynamics models. In this framework, an individual's opinion on a topic is the expected value of their belief, represented as a random variable with a prior…
The voter model is a classical interacting particle system, modelling how global consensus is formed by local imitation. We analyse the time to consensus for a particular family of voter models when the underlying structure is a scale-free…
We study a variant of the voter model on a coevolving network in which interactions of two individuals with differing opinions only lead to an agreement on one of these opinions with a fixed probability $q$. Otherwise, with probability…
Inspired by the work of [Kempe, Kleinberg, Oren, Slivkins, EC13] we introduce and analyze a model on opinion formation; the update rule of our dynamics is a simplified version of that of Kempe et. al. We assume that the population is…
We study the evolution of opinions on a directed network with community structure. Individuals update their opinions synchronously based on a weighted average of their neighbors' opinions, their own previous opinions, and external media…
We study a model for continuous-opinion dynamics under bounded confidence. In particular, we analyze the importance of the initial distribution of opinions in determining the asymptotic configuration. Thus, we sketch the structure of…
We study multidimensional opinion dynamics under confirmation bias in social networks. Each agent holds a vector of correlated opinions across multiple topic layers. Peer interaction is modeled through a static, informationally symmetric…
Consensus of autonomous agents is a benchmark problem in multi-agent control. In this paper, we consider continuous-time averaging consensus policies (or Laplacian flows) and their discrete-time counterparts over time-varying graphs in…
This paper introduces a heterogeneous multidimensional bounded confidence (BC) opinion dynamics with random pairwise interactions, whereby each pair of agents accesses each other's opinions with a specific probability. This revised model is…
A new agent-based, bounded-confidence model for discrete one-dimensional opinion dynamics is presented. The agents interact if their opinions do not differ more than a tolerance parameter. In pairwise interactions, one of the pair, randomly…
A voter sits on each vertex of an infinite tree of degree $k$, and has to decide between two alternative opinions. At each time step, each voter switches to the opinion of the majority of her neighbors. We analyze this majority process when…
We consider a coupled Polya's urn scheme for social dynamics on networks. Agents hold continuum-valued opinions on a two-state issue and randomly converse with their neighbors on a graph, agreeing on one of the two states. The probability…
In this paper, we study the evolution of opinions over social networks with bounded confidence in social cliques. Node initial opinions are independently and identically distributed; at each time step, nodes review the average opinions of a…