Related papers: The Evolving Voter Model on Thick Graphs
In elections, the vote shares or turnout rates show a strong spatial correlation. The logarithmic decay with distance suggests that a 2D noisy diffusive equation describes the system. Based on the study of U.S. presidential elections data,…
Public opinion is often affected by the presence of committed groups of individuals dedicated to competing points of view. Using a model of pairwise social influence, we study how the presence of such groups within social networks affects…
We study simple interacting particle systems on heterogeneous networks, including the voter model and the invasion process. These are both two-state models in which in an update event an individual changes state to agree with a neighbor.…
We investigate opinion dynamics in multi-agent networks when a bias toward one of two possible opinions exists; for example, reflecting a status quo vs a superior alternative. Starting with all agents sharing an initial opinion representing…
Pull voting is a random process in which vertices of a connected graph have initial opinions chosen from a set of $k$ distinct opinions, and at each step a random vertex alters its opinion to that of a randomly chosen neighbour. If the…
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…
Consider a graph $G$, representing a social network. Assume that initially each node is colored either black or white, which corresponds to a positive or negative opinion regarding a consumer product or a technological innovation. In the…
We study a discrete-time consensus model in which agents iteratively update their states through interactions on a dynamic social network. At each step, a single agent is selected asynchronously and averages the values of its current…
Consider n individuals who, by popular vote, choose among q >= 2 alternatives, one of which is "better" than the others. Assume that each individual votes independently at random, and that the probability of voting for the better…
We propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for…
We introduce a statistical physics model for opinion dynamics on random networks where agents adopt the opinion held by the majority of their direct neighbors only if the fraction of these neighbors exceeds a certain threshold, p_u. We find…
This paper examines a model involving two dynamic Erd\H{o}s-R\'enyi random graphs that evolve in parallel, with edges in each graph alternating between being present and absent according to specified on- and off-time distributions. A key…
Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion.…
We introduce a socially motivated extension of the voter model in which individual voters are also influenced by two opposing, fixed-opinion news sources. These sources forestall consensus and instead drive the population to a politically…
Two of the main factors shaping an individual's opinion are social coordination and personal preferences, or personal biases. To understand the role of those and that of the topology of the network of interactions, we study an extension of…
We consider a discrete-time voter model process on a set of nodes, each being in one of two states, either 0 or 1. In each time step, each node adopts the state of a randomly sampled neighbor according to sampling probabilities, referred to…
Online social networks have become primary means of communication. As they often exhibit undesirable effects such as hostility, polarisation or echo chambers, it is crucial to develop analytical tools that help us better understand them. In…
We study the evolution of majority dynamics on Erd\H{o}s-R\'enyi $G(n,p)$ random graphs. In this process, each vertex of a graph is assigned one of two initial states. Subsequently, on every day, each vertex simultaneously updates its state…
We study how electoral rules shape polarization dynamics when voters and candidates both adapt to repeated election outcomes. We introduce two geometric primitives for comparing rules under this feedback: the \emph{winner radius} $R_t =…
We study binary opinion dynamics in a fully connected network of interacting agents. The agents are assumed to interact according to one of the following rules: (1) Voter rule: An updating agent simply copies the opinion of another randomly…