Related papers: Discordant edges for the voter model on regular ra…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
We consider a type of pull voting suitable for discrete numeric opinions which can be compared on a linear scale, for example, 1 ('disagree strongly'), 2 ('disagree'), $\ldots,$ 5 ('agree strongly'). On observing the opinion of a random…
In this paper we consider two-opinion voter models on dynamic random graphs, in which the joint dynamics of opinions and graphs acts as one-way feedback, i.e., edges appear and disappear over time depending on the opinions of the two…
We investigate a variation of the classical voter model in which the set of influencing agents depends on an individual's current opinion. The initial population consists of a random sample of equally sized sub-populations for each state,…
This article is concerned with a general class of stochastic spatial models for the dynamics of opinions. Like in the voter model, individuals are located on the vertex set of a connected graph and update their opinion at a constant rate…
We study a distributed consensus problem on a complete communication network of $n$ vertices, each holding one of two opinions. The vertices communicate in rounds, possibly in the presence of adversarial noise, and exchange information…
The constrained voter model describes the dynamics of opinions in a population of individuals located on a connected graph. Each agent is characterized by her opinion, where the set of opinions is represented by a finite sequence of…
The Deffuant model is a spatial stochastic model for the dynamics of opinions in which individuals are located on a connected graph representing a social network and characterized by a number in the unit interval representing their opinion.…
The voter model is an archetypal stochastic process that represents opinion dynamics. In each update, one agent is chosen uniformly at random. The selected agent then copies the current opinion of a randomly selected neighbour. We…
We investigate coarsening and persistence in the voter model by introducing the quantity $P_n(t)$, defined as the fraction of voters who changed their opinion n times up to time t. We show that $P_n(t)$ exhibits scaling behavior that…
We study consensus processes on the complete graph of $n$ nodes. Initially, each node supports one from up to n opinions. Nodes randomly and in parallel sample the opinions of constant many nodes. Based on these samples, they use an update…
In the voter model, vertices of a graph (interpreted as voters) adopt one out of two opinions (0 and 1), and update their opinions at random times by copying the opinion of a neighbor chosen uniformly at random. This process is dual to a…
We study an opinion dynamics model that explores the competition between persuasion and compromise in a population of agents with nearest-neighbor interactions on a two-dimensional square lattice. Each agent can hold either a positive or a…
We analyze the asynchronous version of the DeGroot dynamics: In a connected graph $G$ with $n$ nodes, each node has an initial opinion in $[0,1]$ and an independent Poisson clock. When a clock at a node $v$ rings, the opinion at $v$ is…
Society is often polarized by controversial issues, that split the population into groups of opposing views. When such issues emerge on social media, we often observe the creation of 'echo chambers', i.e., situations where like-minded…
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.…
By incorporating a multilayer network and time-decaying memory into the original voter model, the coupled effects of spatial and temporal cumulation of peer pressure on consensus are investigated. Heterogeneity in peer pressure and…
Opinion diffusion is a crucial phenomenon in social networks, often underlying the way in which a collective of agents develops a consensus on relevant decisions. The voter model is a well-known theoretical model to study opinion spreading…
We introduce time variation in the flip-rates of the Voter Model. This type of generalisation is relevant to models of ageing in language change, allowing the representation of changes in speakers' learning rates over their lifetime and may…
Coalescing random walk on a unimodular random rooted graph for which the root has finite expected degree visits each site infinitely often almost surely. A corollary is that an opinion in the voter model on such graphs has infinite expected…