Related papers: Latent Voter Model on Locally Tree-Like Random Gra…
In this paper we examine a variant of the voter model on a dynamically changing network where agents have the option of changing their friends rather than changing their opinions. We analyse, in the context of dense random graphs, two…
We study the effect of latency on binary-choice opinion formation models. Latency is introduced into the models as an additional dynamic rule: after a voter changes its opinion, it enters a waiting period of stochastic length where no…
In the evolving voter model, when an individual interacts with a neighbor having an opinion different from theirs, they will with probability $1-\alpha$ imitate the neighbor but with probability $ \alpha$ will sever the connection and…
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.…
The voter model is a classical interacting particle system explaining consensus formation on a social network. Real social networks feature not only a heterogeneous degree distribution but also connections changing over time. We study the…
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 cognitive process of opinion formation is often characterized by stubbornness or resistance of agents to changes of opinion. To capture such a feature we introduce a constant latency time in the standard voter model of opinion dynamics:…
We investigate the dynamics of the majority-rule opinion formation model when voters experience differential latencies. With this extension, voters that just adopted an opinion go into a latent state during which they are excluded from the…
We study the voter model dynamics in the presence of confidence and bias. We assume two types of voters. Unbiased voters whose confidence is indifferent to the state of the voter and biased voters whose confidence is biased towards a common…
We consider the voter model with binary opinions on a random regular graph with $n$ vertices of degree $d \geq 3$, subject to a rewiring dynamics in which pairs of edges are rewired, i.e., broken into four half-edges and subsequently…
In traditional voter models, opinion dynamics are driven by interactions between individuals, where an individual adopts the opinion of a randomly chosen neighbor. However, these models often fail to capture the emergence of entirely new…
We explore the voter model dynamics on a directed random graph model ensemble (digraphs), given by the Directed Configuration Model. The voter model captures the evolution of opinions over time on a graph where each vertex represents an…
In this work, we investigate interactions that simultaneously order a system locally, while keeping it globally disordered. The study is done in the context of the emergence of diversity in opinion propagation models with interactions…
In the voter model, each node of a graph has an opinion, and in every round each node chooses independently a random neighbour and adopts its opinion. We are interested in the consensus time, which is the first point in time where all nodes…
Social media users have finite attention which limits the number of incoming messages from friends they can process. Moreover, they pay more attention to opinions and recommendations of some friends more than others. In this paper, we…
The voter model is a paradigm of ordering dynamics. At each time step, a random node is selected and copies the state of one of its neighbors. Traditionally, this state has been considered as a binary variable. Here, we relax this…
Consider an undirected graph G, representing a social network, where each node is blue or red, corresponding to positive or negative opinion on a topic. In the voter model, in discrete time rounds, each node picks a neighbour uniformly at…
Inspired by the spread of discontent as in the 2016 presidential election, we consider a voter model in which 0's are ordinary voters and 1's are zealots. Thinking of a social network, but desiring the simplicity of an infinite object that…
We present a mathematical description of the voter model dynamics on heterogeneous networks. When the average degree of the graph is $\mu \leq 2$ the system reaches complete order exponentially fast. For $\mu >2$, a finite system falls,…
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…