Related papers: Tight Analysis for the 3-Majority Consensus Dynami…
We consider a stochastic, continuous state and time opinion model where each agent's opinion locally interacts with other agents' opinions in the system, and there is also exogenous randomness. The interaction tends to create clusters of…
Three conjectures from [R. Hegselmann, The Journal of Artificial Societies and Social Simulations 26(4), 11 (2023)] about the Hegselmann-Krause opinion dynamics and the structure of $\epsilon$-switches are proved. The first conjecture…
Public opinion governance in social networks is critical for public health campaigns, political elections, and commercial marketing. In this paper, we addresse the problem of maximizing overall opinion in social networks by strategically…
People often face the challenge of choosing among different options with similar attractiveness. To study the distribution of preferences that emerge in such situations, a useful approach is to simulate opinion dynamics on top of complex…
Among the different disciplines in the social, behavioral and economic sciences, a fundamental class of problems is related to the prediction of the final state of the presence of individual opinions in a large population. The main aspects…
We investigate a model for opinion dynamics, where individuals (modeled by vertices of a graph) hold certain abstract opinions. As time progresses, neighboring individuals interact with each other, and this interaction results in a…
This paper is about a new model of opinion dynamics with opinion-dependent connectivity. We assume that agents update their opinions asynchronously and that each agent's new opinion depends on the opinions of the $k$ agents that are closest…
We study analytically a variant of the one-dimensional majority-vote model in which the individual retains its opinion in case there is a tie among the neighbors' opinions. The individuals are fixed in the sites of a ring of size $L$ and…
Synchronous Counting is the task of reaching agreement on a common round counter in a synchronous system of $n$ nodes with up to $t$ Byzantine faults in a self-stabilizing manner. That is, after transient faults may have arbitrarily…
We consider a general class of three--state models where individuals hold one of two opposite opinions, or are neutral, and exchange opinions in generic pairwise interactions. We show that when opinions spread in a population where a…
There has recently been a surge of interest in the computational and complexity properties of the population model, which assumes $n$ anonymous, computationally-bounded nodes, interacting at random, and attempting to jointly compute global…
We study distributed computation in synchronous dynamic networks where an omniscient adversary controls the unidirectional communication links. Its behavior is modeled as a sequence of directed graphs representing the active (i.e. timely)…
In their seminal work on the Stable Marriage Problem, Gale and Shapley describe an algorithm which finds a stable matching in $O(n^2)$ communication rounds. Their algorithm has a natural interpretation as a distributed algorithm where each…
We investigate the long-time behavior of a majority rule opinion dynamics model in finite spatial dimensions. Each site of the system is endowed with a two-state spin variable that evolves by majority rule. In a single update event, a group…
We study the collective motion of a large set of self-propelled particles subject to voter-like interactions. Each particle moves on a two-dimensional space at a constant speed in a direction that is randomly assigned initially. Then, at…
We consider a group of agents connected by a social network who participate in majority dynamics: each agent starts with an opinion in {-1,+1} and repeatedly updates it to match the opinion of the majority of its neighbors. We assume that…
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…
In this paper, we propose a distributed Newton method for consensus optimization. Our approach outperforms state-of-the-art methods, including ADMM. The key idea is to exploit the sparsity of the dual Hessian and recast the computation of…
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 propose an exactly solvable model for the dynamics of voters in a two-party system. The opinion formation process is modeled on a random network of agents. The dynamical nature of interpersonal relations is also reflected in the model,…