Related papers: The Evolving Voter Model on Thick Graphs
In the $q$-voter model, the voter at $x$ changes its opinion at rate $f_x^q$, where $f_x$ is the fraction of neighbors with the opposite opinion. Mean-field calculations suggest that there should be coexistence between opinions if $q<1$ and…
We consider a class of particle systems described by differential equations (both stochastic and deterministic), in which the interaction network is determined by the realization of an Erd\H{o}s-R\'enyi graph with parameter $p_n\in (0, 1]$,…
We consider a coupled Polya's urn scheme for social dynamics on networks. Agents hold continuum-valued opinions on a two-state issue and randomly converse with their neighbors on a graph, agreeing on one of the two states. The probability…
The problem of detecting edge correlation between two Erd\H{o}s-R\'enyi random graphs on $n$ unlabeled nodes can be formulated as a hypothesis testing problem: under the null hypothesis, the two graphs are sampled independently; under the…
We investigate a randomly evolving process of subgraphs in an underlying host graph using the spectral theory of semigroups related to the Tsetlin library and hyperplane arrangements. Starting with some initial subgraph, at each iteration,…
We investigate the coarsening kinetics in a long-range variant of the Persistent Voter Model in space dimension $d=1$ and 2. In this model agents can hold two confidence levels, normal and zealot. If normal, agents take the opinion of…
In this paper, we consider the voter model with popularity bias. The influence of each node on its neighbors depends on its degree. We find the consensus probabilities and expected consensus times for each of the states. We also find the…
Emergence of dominating cliques in Erd\"os-R\'enyi random graph model ${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability $p$, an…
The voter model is an archetypal stochastic process that represents opinion dynamics. In each update, one agent is chosen uniformly at random. The selected agent then copies the current opinion of a randomly selected neighbour. We…
The evolution of two species with different fitness is investigated on degree-heterogeneous graphs. The population evolves either by one individual dying and being replaced by the offspring of a random neighbor (voter model (VM) dynamics)…
We propose a model of network formation based on reinforcement learning, which can be seen as a generalization as the one proposed by Skyrms for signaling games. On a discrete graph, whose vertices represent individuals, at any time step…
We investigate the convergence towards equilibrium of the noisy voter model, evolving in the complete graph with n vertices. The noisy voter model is a version of the voter model, on which individuals change their opinions randomly due to…
A continuous-opinion model accounting for the social compromise propensity is theoretically and numerically analysed. An agent's opinion is represented by a real number that can be changed through social interactions with her neighbours.…
This paper studies the evolution of the distribution of opinions in a population of individuals in which there exist two distinct subgroups of highly-committed, well-connected opinion leaders endowed with a strong convincing power. Each…
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…
In this paper, we propose a new model for continuous time opinion dynamics on an evolving network. As opposed to existing models, in which the network typically evolves by discretely adding or removing edges, we instead propose a model for…
Many empirical networks are intrinsically pluralistic, with interactions occurring within groups of arbitrary agents. Then the agent in the network can be influenced by types of neighbors, common examples include similarity, opposition, and…
We investigate the problem of recovering a latent directed Erd\H{o}s-R\'enyi graph $G^*\sim \mathcal G(n,p)$ from observations of discrete voter model trajectories on $G^*$, where $np$ grows polynomially in $n$. Given access to $M$…
The conventional voter model is modified so that an agent's switching rate depends on the `age' of the agent, that is, the time since the agent last switched opinion. In contrast to previous work, age is continuous in the present model. We…
Assume for a graph $G=(V,E)$ and an initial configuration, where each node is blue or red, in each discrete-time round all nodes simultaneously update their color to the most frequent color in their neighborhood and a node keeps its color…