Related papers: Voter models on subcritical inhomogeneous random g…
Understanding political phenomena requires measuring the political preferences of society. We introduce a model based on mixtures of spatial voting models that infers the underlying distribution of political preferences of voters with only…
In this paper, we discuss a voting model by considering three different kinds of networks: a random graph, the Barab\'{a}si-Albert(BA) model, and a fitness model. A voting model represents the way in which public perceptions are conveyed to…
Formation of consensus, in binary yes/no type of voting, is a well defined process. However, even in presence of clear incentives, the dynamics involved can be incredibly complex. Specifically, formations of large groups of similarly…
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…
The majority vote model is one of the simplest opinion systems yielding distinct phase transitions and has garnered significant interest in recent years. However, its original formulation is not, in general, thermodynamically consistent,…
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…
We explore the networks that yield the largest mean consensus time of voter models under different update rules. By analytical and numerical means, we show that the so-called lollipop graph, barbell graph, and double star graph maximise the…
Social learning algorithms provide models for the formation of opinions over social networks resulting from local reasoning and peer-to-peer exchanges. Interactions occur over an underlying graph topology, which describes the flow of…
We address the link between the controllability or observability of a stochastic complex system and concepts of information theory. We show that the most influential degrees of freedom can be detected without acting on the system, by…
We introduce a general methodology of update rules accounting for arbitrary interevent time distributions in simulations of interacting agents. In particular we consider update rules that depend on the state of the agent, so that the update…
We propose a generalized framework for the study of voter models in complex networks at the the heterogeneous mean-field (HMF) level that (i) yields a unified picture for existing copy/invasion processes and (ii) allows for the introduction…
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…
We consider two independent stationary random walks on large random regular graphs of degree $k\geq 3$ with $N$ vertices. On these graphs, the exponential approximations of the meeting times are known to follow from existing methods and…
The voter model on $\mathbb{Z}^d$ is a particle system that serves as a rough model for changes of opinions among social agents or, alternatively, competition between biological species occupying space. When $d \geq 3$, the set of…
Mass Media outlets have occupied the central role of the political scenario, and are persuasive in the process of opinion formation of the citizens. In particular, the study of the relationship between Mass Media and behaviour of citizens…
We introduce a coevolution voter model in a multilayer, by coupling a fraction of nodes across two network layers and allowing each layer to evolve according to its own topological temporal scale. When these time scales are the same the…
We investigate how the topology of small-world networks affects the dynamics of the voter model for opinion formation. We show that, contrary to what occurs on regular topologies with local interactions, the voter model on small-world…
We introduce a voting model that is similar to a Keynesian beauty contest and analyze it from a mathematical point of view. There are two types of voters-copycat and independent-and two candidates. Our voting model is a binomial…
We consider the two-opinion voter model on a regular random graph with n vertices and degree $d \geq 3$. It is known that consensus is reached on time scale n and that on this time scale the volume of the set of vertices with one opinion…
Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion.…