Related papers: Discursive Voter Models on the Supercritical Scale…
We study the behavior of a generalized consensus dynamics on a temporal network of interactions, the activity driven network with attractiveness. In this temporal network model, agents are endowed with an intrinsic activity $a$, ruling the…
Majority-vote model is a much-studied model for social opinion dynamics of two competing opinions. With the recent appreciation that our social network comprises a variety of different layers forming a multiplex network, a natural question…
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.…
We consider a modification of the adaptive contact process which, interpreted in the context of opinion dynamics, breaks the symmetry of the coevolutionary voter model by assigning to each node type a different strategy to promote…
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…
Several algorithms in prior literature have been proposed which guarantee consensus of normally behaving agents in a network that may contain adversarially behaving agents. These algorithms guarantee that the consensus value lies within the…
Progress in theoretical physics is often made by the investigation of toy models, the model organisms of physics, which provide benchmarks for new methodologies. For complex systems, one such model is the adaptive voter model. Despite its…
In the Deffuant model, individuals are located on the vertices of a graph, and are characterized by their opinion, a number in $[-1, 1]$. The dynamics depends on two parameters: a confidence threshold $\theta < 2$ and a convergent parameter…
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 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…
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…
In the latent voter model, which models the spread of a technology through a social network, individuals who have just changed their choice have a latent period, which is exponential with rate $\lambda$, during which they will not buy a new…
We study an adaptive network model driven by a nonlinear voter dynamics. Each node in the network represents a voter and can be in one of two states that correspond to different opinions shared by the voters. A voter disagreeing with its…
In populations with community structure, the formation of consensus requires both alignment within and diffusion of beliefs across groups, processes that evolve on distinct time scales. How do modularity, asymmetry, and polarization shape…
The majority-vote model with noise on random graphs has been studied. Monte Carlo simulations were performed to characterize the order-disorder phase transition appearing in the system. We found that the value of the critical noise…
In this paper we investigate a model of consensus decision making [Hartnett A. T., et al., Phys. Rev. Lett., 2016, 116, 038701] following a statistical physics approach presented in [Sarkanych P., et al., Phys. Biol., 2023, 20, 045005].…
We provide a numerical study of the macroscopic model of [3] derived from an agent-based model for a system of particles interacting through a dynamical network of links. Assuming that the network remodelling process is very fast, the…
The Shapley-Shubik power index is a measure of each voters power in the passage or failure of a vote. We extend this measure to graphs and consider a discrete-time process in which voters may change their vote based on the outcome of the…
Building on recent work by Medvedev (2014) we establish new connections between a basic consensus model, called the voting model, and the theory of graph limits. We show that in the voting model if consensus is attained in the continuum…