Related papers: Nonlinear q-voter model with deadlocks on the Watt…
We formulate and investigate the nonlinear $q$-voter model (which as special cases includes the linear voter and the Sznajd model) on a one dimensional lattice. We derive analytical formula for the exit probability and show that it agrees…
We present a detailed investigation of the behavior of the nonlinear q-voter model for opinion dynamics. At the mean-field level we derive analytically, for any value of the number q of agents involved in the elementary update, the phase…
We discuss the exit probability of the one dimensional $q$-voter model and present tools to obtain estimates about this probability both through simulations in large networks (around $10^7$ sites) and analyticaly in the limit where the…
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…
We study the dynamics of the out-of-equilibrium nonlinear q-voter model with two types of susceptible voters and zealots, introduced in [EPL 113, 48001 (2016)]. In this model, each individual supports one of two parties and is either a…
We propose and compare six different ways of mapping the modified $q$-voter model to complex networks. Considering square lattices, Barab\'asi-Albert, Watts-Strogatz and real Twitter networks, we ask the question if always a particular…
We investigate the q-voter model with stochastic noise arising from independence on complex networks. Using the pair approximation, we provide a comprehensive, mathematical description of its behavior and derive a formula for the critical…
We investigate via Monte Carlo numerical simulations and theoretical considerations the outflux of random walkers moving in an interval bounded by an interface exhibiting channels (pores, doors) which undergo an open/close cycle according…
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…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
An analytical study of the behavior of the voter model on the small-world topology is performed. In order to solve the equations for the dynamics, we consider an annealed version of the Watts-Strogatz (WS) network, where long-range…
Approximate master equations are derived for the two-state $q$-voter model with independence on signed random graphs, with negative and positive weights of links corresponding to antagonistic and reinforcing interactions, respectively.…
We present in this paper an approximation that is able to give an analytical expression for the exit probability of the $q$-voter model in one dimension. This expression gives a better fit for the more recent data about simulations in large…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
We study a generalization of the voter model on complex networks, focusing on the scaling of mean exit time. Previous work has defined the voter model in terms of an initially chosen node and a randomly chosen neighbor, which makes it…
In this work, we propose a scheme that provides an analytical estimate for the time-dependent degree distribution of some networks. This scheme maps the problem into a random walk in degree space, and then we choose the paths that are…
Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…
We study the noisy voter model using a specific non-linear dependence of the rates that takes into account collective interaction between individuals. The resulting model is solved exactly under the all-to-all coupling configuration and…
We present a new probabilistic analysis of distributed algorithms. Our approach relies on the theory of quasi-stationary distributions (QSD) recently developped by Champagnat and Villemonais. We give properties on the deadlock time and the…
We study the dynamics of the voter and Moran processes running on top of complex network substrates where each edge has a weight depending on the degree of the nodes it connects. For each elementary dynamical step the first node is chosen…