Related papers: Asymptotic behaviour of the noisy voter model dens…
We study the stationary states of variants of the noisy voter model, subject to fluctuating parameters or external environments. Specifically, we consider scenarios in which the herding-to-noise ratio switches randomly and on different time…
We give a comprehensive mean-field analysis of the Partisan Voter Model (PVM) and report analytical results for exit probabilities, fixation times, and the quasi-stationary distribution. In addition, and similarly to the noisy voter model,…
The voter model is a toy model of consensus formation based on nearest-neighbor interactions. A voter sits at each vertex in a hypercubic lattice (of dimension $d$) and is in one of two possible opinion states. The opinion state of each…
The influence of contrarians on the noisy voter model is studied at the mean-field level. The noisy voter model is a variant of the voter model where agents can adopt two opinions, optimistic or pessimistic, and can change them by means of…
We investigate the convergence towards equilibrium of the noisy voter model, evolving in the complete graph with n vertices. The noisy voter model is a version of the voter model, on which individuals change their opinions randomly due to…
We study noise sensitivity of the consensus opinion of the voter model on finite graphs, with respect to noise affecting the initial opinions and noise affecting the dynamics. We prove that the final opinion is stable with respect to small…
We observe the outcome of the discrete time noisy voter model at a single vertex of a graph. We show that certain pairs of graphs can be distinguished by the frequency of repetitions in the sequence of observations. We prove that this…
The notions of noise sensitivity and stability were recently extended for the voter model. In this model, the vertices of a graph have opinions that are updated by uniformly selecting edges. We further extend stability results to different…
The symmetric exclusion process and the voter model are two interacting particle systems for which a dual finite particle system allows one to characterize its invariant measures. Adding spontaneous births and deaths to the two processes…
We study the noisy voter model using a specific non-linear dependence of the rates that takes into account collective interaction between individuals. The resulting model is solved exactly under the all-to-all coupling configuration and…
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…
The voter model has been studied extensively as a paradigmatic opinion dynamics' model. However, its ability for modeling real opinion dynamics has not been addressed. We introduce a noisy voter model (accounting for social influence) with…
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…
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 introduce and study the block voter model with noise on two-dimensional square lattices using Monte Carlo simulations and finite-size scaling techniques. The model is defined by an outflow dynamics where a central set of $N_{PCS}$ spins,…
In this work we study the opinion formation in a voter-like model defined on a square lattice of linear size $L$. The agents may be in three different states, representing any public debate with three choices (yes, no, undecided). We…
We study a variant of the voter model with multiple opinions; individuals can imitate each other and also change their opinion randomly in mutation events. We focus on the case of a population with all-to-all interaction. A noise-driven…
We prove that the noisy voter model mixes extremely fast -- in time of $O(\log n)$ on any graph with $n$ vertices -- for arbitrarily small values of the `noise parameter'. We then explain why, as a result, this is an example of a spin…
The voter model is a classical interacting particle system modelling how consensus is formed across a network. We analyse the time to consensus for the voter model when the underlying graph is a subcritical scale-free random graph.…
The voter model with stirring is a variant of the classical voter model on $\mathbb{Z}^d$ with two possible opinions (0 and 1) that, in addition to copying neighbouring opinions at rate 1, allows voters to interchange their opinions at…