Related papers: Ergodic behaviour of "signed voter models"
The voter model with anti-voter bonds is a variant of the classical voter model in which the edges of the underlying graph are assigned signs. At each update, a voter chooses a neighbour according to a transition kernel; interactions across…
In a signed graph, each link is labeled with either a positive or a negative sign. This is particularly appropriate to model polarized systems. Such a graph can be characterized through the notion of structural balance, which relies on the…
We introduce and study the reverse voter model, a dynamics for spin variables similar to the well-known voter dynamics. The difference is in the way neighbors influence each other: once a node is selected and one among its neighbors chosen,…
We study asymptotic dynamical patterns that emerge among a set of nodes interacting in a dynamically evolving signed random network, where positive links carry out standard consensus and negative links induce relative-state flipping. A…
Recent studies from social, biological, and engineering network systems have drawn attention to the dynamics over signed networks, where each link is associated with a positive/negative sign indicating trustful/mistrustful,…
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…
We examine the conditions under which a signed graph contains an edge or a vertex that is contained in a unique negative circle or a unique positive circle. For an edge in a unique signed circle, the positive and negative case require the…
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…
A signed network is a network with each link associated with a positive or negative sign. Models for nodes interacting over such signed networks, where two different types of interactions take place along the positive and negative links,…
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 asymptotic dynamical patterns that emerge among a set of nodes that interact in a dynamically evolving signed random network. Node interactions take place at random on a sequence of deterministic signed graphs. Each node receives…
Signed graphs are graphs with signed edges. They are commonly used to represent positive and negative relationships in social networks. While balance theory and clusterizable graphs deal with signed graphs to represent social interactions,…
A signed graph is a graph whose edges are labelled positive or negative. The sign of a circle (cycle, circuit) is the product of the signs of its edges. Most of the essential properties of a signed graph depend on the signs of its circles.…
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…
The $q$-voter model with independence is generalized to signed random graphs and studied by means of Monte Carlo simulations and theoretically using the mean field approximation and different forms of the pair approximation. In the signed…
Alliances and conflicts in social, political and economic relations can be represented by positive and negative edges in signed networks. A cycle is said to be positive if the product of its edge signs is positive, otherwise it is negative.…
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…
Adaptive networks model social, physical, technical, or biological systems as attributed graphs evolving at the level of both their topology and data. They are naturally described by graph transformation, but the majority of authors take an…
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…
Recent generalization of the coevolving voter model (J. Toruniewska et al, PRE 96 (2017) 042306) is further generalized here, including spin-dependent probability of rewiring. Mean field results indicate that either the system splits into…