ترغب بنشر مسار تعليمي؟ اضغط هنا

The non-linear q-voter model

142   0   0.0 ( 0 )
 نشر من قبل Romualdo Pastor-Satorras
 تاريخ النشر 2009
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

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 have an unanimous opinion, still a voter can flip its state with probability $epsilon$. We solve the model on a fully connected network (i.e. in mean-field) and compute the exit probability as well as the average time to reach consensus. We analyze the results in the perspective of a recently proposed Langevin equation aimed at describing generic phase transitions in systems with two ($Z_2$ symmetric) absorbing states. We find that in mean-field the q-voter model exhibits a disordered phase for high $epsilon$ and an ordered one for low $epsilon$ with three possible ways to go from one to the other: (i) a unique (generalized voter-like) transition, (ii) a series of two consecutive Ising-like and directed percolation transition, and (iii) a series of two transitions, including an intermediate regime in which the final state depends on initial conditions. This third (so far unexplored) scenario, in which a new type of ordering dynamics emerges, is rationalized and found to be specific of mean-field, i.e. fluctuations are explicitly shown to wash it out in spatially extended systems.



قيم البحث

اقرأ أيضاً

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 diagram, the exit probability and the consensus time at the transition point. The mean-field formalism is extended to the case that the interaction pattern is given by generic heterogeneous networks. We finally discuss the case of random regular networks and compare analytical results with simulations.
The voter model with memory-dependent dynamics is theoretically and numerically studied at the mean-field level. The `internal age, or time an individual spends holding the same state, is added to the set of binary states of the population, such that the probability of changing state (or activation probability $p_i$) depends on this age. A closed set of integro-differential equations describing the time evolution of the fraction of individuals with a given state and age is derived, and from it analytical results are obtained characterizing the behavior of the system close to the absorbing states. In general, different age-dependent activation probabilities have different effects on the dynamics. When the activation probability $p_i$ is an increasing function of the age $i$, the system reaches a steady state with coexistence of opinions. In the case of aging, with $p_i$ being a decreasing function, either the system reaches consensus or it gets trapped in a frozen state, depending on the value of $p_infty$ (zero or not) and the velocity of $p_i$ approaching $p_infty$. Moreover, when the system reaches consensus, the time ordering of the system can be exponential ($p_infty>0$) or power-law like ($p_infty=0$). Exact conditions for having one or another behavior, together with the equations and explicit expressions for the exponents, are provided.
We study memory dependent binary-state dynamics, focusing on the noisy-voter model. This is a non-Markovian process if we consider the set of binary states of the population as the description variables, or Markovian if we incorporate age, related to the time one has spent holding the same state, as a part of the description. We show that, in some cases, the model can be reduced to an effective Markovian process, where the age distribution of the population rapidly equilibrates to a quasi-steady state, while the global state of the system is out of equilibrium. This effective Markovian process shares the same phenomenology of the non-linear noisy-voter model and we establish a clear parallelism between these two extensions of the noisy-voter model.
We consider the process of reaching the final state in the coevolving voter model. There is a coevolution of state dynamics, where a node can copy a state from a random neighbor with probabilty $1-p$ and link dynamics, where a node can re-wire its li nk to another node of the same state with probability $p$. That exhibits an absorbing transition to a frozen phase above a critical value of rewiring probability. Our analytical and numerical studies show that in the active phase mean values of magnetization of nodes $n$ and links $m$ tend to the same value that depends on initial conditions. In a similar way mean degrees of spins up and spins down become equal. The system obeys a special statistical conservation law since a linear combination of both types magnetizations averaged over many realizations starting from the same initial conditions is a constant of motion: $Lambdaequiv (1-p)mu m(t)+pn(t) = const$, where $mu$ is the mean node degree. The final mean magnetization of nodes and links in the active phase is proportional to $Lambda$ while the final density of active links is a square function of $Lambda$. If the rewiring probability is above a critical value and the system separates into disconnected domains, then the values of nodes and links magnetizations are not the same and final mean degrees of spins up and spins down can be different.
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 of furthe r heterogeneity through degree-selectivity rules. In the context of the HMF approximation, our model is capable of providing straightforward estimates for central quantities such as the exit probability and the consensus/fixation time, based on the statistical properties of the complex network alone. The HMF approach has the advantage of being readily applicable also in those cases in which exact solutions are difficult to work out. Finally, the unified formalism allows one to understand previously proposed voter-like processes as simple limits of the generalized model.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا