Related papers: Voter model on the two-clique graph
We generalize a binary majority-vote model on adaptive networks to its plurality-vote counterpart and analyze the time scale to consensus when voters are given more than two options. When opinions are uniformly distributed in the population…
The voter model is a simple agent-based model to mimic opinion dynamics in social networks: a randomly chosen agent adopts the opinion of a randomly chosen neighbour. This process is repeated until a consensus emerges. Although the basic…
A statistical network model with overlapping communities can be generated as a superposition of mutually independent random graphs of varying size. The model is parameterized by the number of nodes, the number of communities, and the joint…
We introduce and study the reverse voter model, a dynamics for spin variables similar to the well-known voter dynamics. The difference is in the way neighbors influence each other: once a node is selected and one among its neighbors chosen,…
Formation of consensus, in binary yes/no type of voting, is a well defined process. However, even in presence of clear incentives, the dynamics involved can be incredibly complex. Specifically, formations of large groups of similarly…
The Majority Rule is applied to a topology that consists of two coupled random networks, thereby mimicking the modular structure observed in social networks. We calculate analytically the asymptotic behaviour of the model and derive a phase…
We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "correct" with probability $\frac{1}{2}+\delta$ for some $\delta…
The aim of this paper is to analyze a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks formed by agents with first-order dynamics. In particular, in the analyzed class a single evaluation of a…
The complexity of human behaviour can lead to very unpredictable patterns in social activity and structure. Here we demonstrate the instability of a community network controlled by majority ruling, where an element adopts the most popular…
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…
Majority-vote model is a much-studied model for social opinion dynamics of two competing opinions. With the recent appreciation that our social network comprises a variety of different layers forming a multiplex network, a natural question…
Understanding and quantifying polarization in social systems is important because of many reasons. It could for instance help to avoid segregation and conflicts in the society or to control polarized debates and predict their outcomes. In…
In the stochastic population protocol model, we are given a connected graph with $n$ nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental…
Simmering debates leading to polarization are observed in many domains. Although empirical findings show a strong correlation between this phenomenon and modularity of a social network, still little is known about the actual mechanisms…
We consider the convergence time for solving the binary consensus problem using the interval consensus algorithm proposed by B\' en\' ezit, Thiran and Vetterli (2009). In the binary consensus problem, each node initially holds one of two…
In many applications, it becomes necessary for a set of distributed network nodes to agree on a common value or opinion as quickly as possible and with minimal communication overhead. The classical 2-choices rule is a well-known distributed…
The adaptive voter model is widely used to model opinion dynamics in social complex networks. However, existing adaptive voter models are limited to only pairwise interactions and fail to capture the intricate social dynamics that arises in…
We consider the two-opinion voter model on a regular random graph with n vertices and degree $d \geq 3$. It is known that consensus is reached on time scale n and that on this time scale the volume of the set of vertices with one opinion…
We analyze a class of distributed quantized consen- sus algorithms for arbitrary networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network, and…
We introduce the confident voter model, in which each voter can be in one of two opinions and can additionally have two levels of commitment to an opinion --- confident and unsure. Upon interacting with an agent of a different opinion, a…