相关论文: Ergodic behaviour of "signed voter models"

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 stochastic dynamics of the multi-state voter model is investigated on a class of complex networks made of non-overlapping cliques, each hosting a political candidate and interacting with the others via Erd\H{o}s-R\'enyi links. Numerical…

Link sign prediction on a signed graph is a task to determine whether the relationship represented by an edge is positive or negative. Since the presence of negative edges violates the graph homophily assumption that adjacent nodes are…

The rebellious voter model, introduced by Sturm and Swart (2008), is a variation of the standard, one-dimensional voter model, in which types that are locally in the minority have an advantage. It is related, both through duality and…

Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. Generalizing the notion of gain graphs, skew…

This paper introduces a definition of ideological polarization of an electorate around a particular central point. By being flexible about the location or width of the center, this measure enables the researcher to analyze polarization…

A signed graph is a graph in which each edge has a positive or negative sign. In this article, first we characterize the distance compatibility in the case of a connected signed graph and discussed the distance compatibility criterion for…

By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…

Bipartite Graph is often a realistic model of complex networks where two different sets of entities are involved and relationship exist only two entities belonging to two different sets. Examples include the user-item relationship of a…

We study the parameterized control complexity of fallback voting, a voting system that combines preference-based with approval voting. Electoral control is one of many different ways for an external agent to tamper with the outcome of an…

We introduce a non-linear variant of the voter model, the q-voter model, in which q neighbors (with possible repetition) are consulted for a voter to change opinion. If the q neighbors agree, the voter takes their opinion; if they do not…

This paper proposes a novel signed $\beta$-model for directed signed network, which is frequently encountered in application domains but largely neglected in literature. The proposed signed $\beta$-model decomposes a directed signed network…

Bipartite networks provide a major insight into the organisation of many real-world systems. One of the most relevant issues encountered when modelling a bipartite network is that of facing the information shortage concerning intra-layer…

Let ${\mathcal G}$ be an infinite family of connected graphs and let $k$ be a positive integer. We say that $k$ is ${\it forcing}$ for ${\mathcal G}$ if for all $G \in {\mathcal G}$ but finitely many, the following holds. Any…

We study an opinion formation model by the means of a co-evolving complex network where the vertices represent the individuals, characterised by their evolving opinions, and the edges represent the interactions among them. The network…

We consider an extension of a binary decision model in which nodes make decisions based on influence-biased averages of their neighbors' states, similar to Ising spin glasses with on-site random fields. In the limit where these influences…

We introduce the voter model on the infinite lattice with a slow membrane and investigate its hydrodynamic behavior and nonequilibrium fluctuations. The model is defined as follows: a voter adopts one of its neighbors' opinion at rate one…

Given a transition matrix $P$ indexed by a finite set $V$ of vertices, the voter model is a discrete-time Markov chain in $\{0,1\}^V$ where at each time-step a randomly chosen vertex $x$ imitates the opinion of vertex $y$ with probability…

The one-dimensional long-range voter model, where an agent takes the opinion of another at distance $r$ with probability $\propto r^{-\alpha}$, is studied analytically. The model displays rich and diverse features as $\alpha$ is changed.…

Network data has attracted growing interest across scientific domains, prompting the development of various network models. Existing network analysis methods mainly focus on unsigned networks, whereas signed networks, consisting of both…