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 approximately in some random network environments. In the all-to-all setup, we find that the non-linear interactions induce bona fide phase transitions that, contrary to the linear version of the model, survive in the thermodynamic limit. The main effect of the complex network is to shift the transition lines and modify the finite-size dependence, a modification that can be captured with the introduction of an effective system size that decreases with the degree heterogeneity of the network. While a non-trivial finite-size dependence of the moments of the probability distribution is derived from our treatment, mean-field exponents are nevertheless obtained in the thermodynamic limit. These theoretical predictions are well confirmed by numerical simulations of the stochastic process.
We present a full stochastic description of the pair approximation scheme to study binary-state dynamics on heterogeneous networks. Within this general approach, we obtain a set of equations for the dynamical correlations, fluctuations and finite-size effects, as well as for the temporal evolution of all relevant variables. We test this scheme for a prototypical model of opinion dynamics known as the noisy voter model that has a finite-size critical point. Using a closure approach based on a system size expansion around a stochastic dynamical attractor we obtain very accurate results, as compared with numerical simulations, for stationary and time dependent quantities whether below, within or above the critical region. We also show that finite-size effects in complex networks cannot be captured, as often suggested, by merely replacing the actual system size $N$ by an effective network dependent size $N_{{\rm eff}}$.
Individuals of modern societies share ideas and participate in collective processes within a pervasive, variable, and mostly hidden ecosystem of content filtering technologies that determine what information we see online. Despite the impact of these algorithms on daily life and society, little is known about their effect on information transfer and opinion formation. It is thus unclear to what extent algorithmic bias has a harmful influence on collective decision-making, such as a tendency to polarize debate. Here we introduce a general theoretical framework to systematically link models of opinion dynamics, social network structure, and content filtering. We showcase the flexibility of our framework by exploring a family of binary-state opinion dynamics models where information exchange lies in a spectrum from pairwise to group interactions. All models show an opinion polarization regime driven by algorithmic bias and modular network structure. The role of content filtering is, however, surprisingly nuanced; for pairwise interactions it leads to polarization, while for group interactions it promotes coexistence of opinions. This allows us to pinpoint which social interactions are robust against algorithmic bias, and which ones are susceptible to bias-enhanced opinion polarization. Our framework gives theoretical ground for the development of heuristics to tackle harmful effects of online bias, such as information bottlenecks, echo chambers, and opinion radicalization.
1 August 2020 in Physica A: Statistical Mechanics and its Applications
Aging is considered as the property of the elements of a system to be less prone to change states as they get older. We incorporate aging into the noisy voter model, a stochastic model in which the agents modify their binary state by means of noise and pairwise interactions. Interestingly, due to aging the system passes from a finite-size discontinuous transition between ordered (ferromagnetic) and disordered (paramagnetic) phases to a second order phase transition, well defined in the thermodynamic limit, belonging to the Ising universality class. We characterize it analytically by finding the stationary solution of an infinite set of mean field equations. The theoretical predictions are tested with extensive numerical simulations in low dimensional lattices and complex networks. We finally employ the aging properties to understand the symmetries broken in the phase transition.
In the standard -voter model, a given agent can change its opinion only if there is a full consensus of the opposite opinion within a group of influence of size . A more realistic extension is the threshold voter, where a minimal agreement (at least opposite opinions) is sufficient to flip the central agent's opinion, including also the possibility of independent (nonconformist) choices. Variants of this model including nonconformist behavior have been previously studied in fully connected networks (mean-field limit). Here we investigate its dynamics in random networks. Particularly, while in the mean-field case it is irrelevant whether repetitions in the influence group are allowed, we show that this is not the case in networks, and we study the impact of both cases, with or without repetition. Furthermore, the results of computer simulations are compared with the predictions of the pair approximation derived for uncorrelated networks of arbitrary degree distributions.