Related papers: Voter Models on Heterogeneous Networks
We introduce a model for innovation-, evolution- and opinion dynamics whose spreading is dictated by unanimity rules, i.e. a node will change its (binary) state only if all of its neighbours have the same corresponding state. It is shown…
A one-dimensional interacting particle system is said to exhibit interface tightness if starting in an initial condition describing the interface between two constant configurations of different types, the process modulo translations is…
For models whose evolution takes place on a network it is often necessary to augment the mean-field approach by considering explicitly the degree dependence of average quantities (heterogeneous mean-field). Here we introduce the degree…
The voter model with the node update rule is numerically investigated on a directed network. We start from a directed hierarchical tree, and split and rewire each incoming arc at the probability $p$. In order to discriminate the better and…
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 investigate an extension of the voter model in which voters are equipped with an individual inertia to change their opinion. This inertia depends on the persistence time of a voter's current opinion (ageing). We focus on the case of only…
The Moran process is a classic stochastic process that models the rise and takeover of novel traits in network-structured populations. In biological terms, a set of mutants, each with fitness $m\in(0,\infty)$ invade a population of…
An analytical approach to network dynamics is used to show that when agents copy their state randomly the network arrives to a stationary status in which the distribution of states is independent of the agents degree. The effects of network…
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…
The voter model rules are simple, with agents copying the state of a random neighbor, but they lead to non-trivial dynamics. Besides opinion processes, the model has also applications for catalysis and species competition. Inspired by the…
We address the issue of the reducibility of the dynamics on a multilayer network to an equivalent process on an aggregated single-layer network. As a typical example of models for opinion formation in social networks, we implement the voter…
In this paper, we propose a statistical aggregation method for agent-based models with heterogeneous agents that interact both locally on a complex adaptive network and globally on a market. The method combines three approaches from…
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…
We analyze the ordering dynamics of the voter model in different classes of complex networks. We observe that whether the voter dynamics orders the system depends on the effective dimensionality of the interaction networks. We also find…
We propose a consensus opinion model based on the evolutionary game. In our model, both of the two connected agents receive a benefit if they have the same opinion, otherwise they both pay a cost. Agents update their opinions by comparing…
We investigate the dynamics of a broad class of stochastic copying processes on a network that includes examples from population genetics (spatially-structured Wright-Fisher models), ecology (Hubbell-type models), linguistics (the utterance…
The voter model and the Axelrod model are two of the main stochastic processes that describe the spread of opinions on networks. The former includes social influence, the tendency of individuals to become more similar when they interact,…
We consider a modification of the voter model in which a set of interacting elements (agents) can be in either of two equivalent states (A or B) or in a third additional mixed AB state. The model is motivated by studies of language…
The election control problem through social influence asks to find a set of nodes in a social network of voters to be the starters of a political campaign aiming at supporting a given target candidate. Voters reached by the campaign change…
We study the dynamics of randomly connected networks composed of binary Boolean elements and those composed of binary majority vote elements. We elucidate their differences in both sparsely and densely connected cases. The quickness of…