Limits...
The noisy voter model on complex networks.

Carro A, Toral R, San Miguel M - Sci Rep (2016)

Bottom Line: Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for uncorrelated networks, allowing to deal with the network structure as parametric heterogeneity.In particular, we find that the degree heterogeneity--variance of the underlying degree distribution--has a strong influence on the location of the critical point of a noise-induced, finite-size transition occurring in the model, on the local ordering of the system, and on the functional form of its temporal correlations.Finally, we show how this latter point opens the possibility of inferring the degree heterogeneity of the underlying network by observing only the aggregate behavior of the system as a whole, an issue of interest for systems where only macroscopic, population level variables can be measured.

View Article: PubMed Central - PubMed

Affiliation: IFISC (CSIC-UIB), Instituto de Física Interdisciplinar y Sistemas Complejos, Campus Universitat de les Illes Balears, E-07122, Palma de Mallorca, Spain.

ABSTRACT
We propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for uncorrelated networks, allowing to deal with the network structure as parametric heterogeneity. As an illustration, we study the noisy voter model, a modification of the original voter model including random changes of state. The proposed method is able to unfold the dependence of the model not only on the mean degree (the mean-field prediction) but also on more complex averages over the degree distribution. In particular, we find that the degree heterogeneity--variance of the underlying degree distribution--has a strong influence on the location of the critical point of a noise-induced, finite-size transition occurring in the model, on the local ordering of the system, and on the functional form of its temporal correlations. Finally, we show how this latter point opens the possibility of inferring the degree heterogeneity of the underlying network by observing only the aggregate behavior of the system as a whole, an issue of interest for systems where only macroscopic, population level variables can be measured.

No MeSH data available.


Related in: MedlinePlus

Autocorrelation function of n in log-linear scale for a dichotomous network and a regular 2D lattice.Symbols: Numerical results (averages over 10 networks, 2 realizations per network and 200000 time steps per realization). Solid lines: Analytical results [see equation (23)]. Parameter values are fixed as a = 0.01, h = 1, the system size as N = 2500 and the mean degree as .
© Copyright Policy - open-access
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4837380&req=5

f8: Autocorrelation function of n in log-linear scale for a dichotomous network and a regular 2D lattice.Symbols: Numerical results (averages over 10 networks, 2 realizations per network and 200000 time steps per realization). Solid lines: Analytical results [see equation (23)]. Parameter values are fixed as a = 0.01, h = 1, the system size as N = 2500 and the mean degree as .

Mentions: This expression can be contrasted with numerical results in Fig. 8, where we present the autocorrelation function, normalized by the variance, for the two extreme cases of a network with no degree heterogeneity (regular 2D lattice) and a highly heterogeneous degree distribution (dichotomous network). Note the logarithmic scale in the y-axis.


The noisy voter model on complex networks.

Carro A, Toral R, San Miguel M - Sci Rep (2016)

Autocorrelation function of n in log-linear scale for a dichotomous network and a regular 2D lattice.Symbols: Numerical results (averages over 10 networks, 2 realizations per network and 200000 time steps per realization). Solid lines: Analytical results [see equation (23)]. Parameter values are fixed as a = 0.01, h = 1, the system size as N = 2500 and the mean degree as .
© Copyright Policy - open-access
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4837380&req=5

f8: Autocorrelation function of n in log-linear scale for a dichotomous network and a regular 2D lattice.Symbols: Numerical results (averages over 10 networks, 2 realizations per network and 200000 time steps per realization). Solid lines: Analytical results [see equation (23)]. Parameter values are fixed as a = 0.01, h = 1, the system size as N = 2500 and the mean degree as .
Mentions: This expression can be contrasted with numerical results in Fig. 8, where we present the autocorrelation function, normalized by the variance, for the two extreme cases of a network with no degree heterogeneity (regular 2D lattice) and a highly heterogeneous degree distribution (dichotomous network). Note the logarithmic scale in the y-axis.

Bottom Line: Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for uncorrelated networks, allowing to deal with the network structure as parametric heterogeneity.In particular, we find that the degree heterogeneity--variance of the underlying degree distribution--has a strong influence on the location of the critical point of a noise-induced, finite-size transition occurring in the model, on the local ordering of the system, and on the functional form of its temporal correlations.Finally, we show how this latter point opens the possibility of inferring the degree heterogeneity of the underlying network by observing only the aggregate behavior of the system as a whole, an issue of interest for systems where only macroscopic, population level variables can be measured.

View Article: PubMed Central - PubMed

Affiliation: IFISC (CSIC-UIB), Instituto de Física Interdisciplinar y Sistemas Complejos, Campus Universitat de les Illes Balears, E-07122, Palma de Mallorca, Spain.

ABSTRACT
We propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for uncorrelated networks, allowing to deal with the network structure as parametric heterogeneity. As an illustration, we study the noisy voter model, a modification of the original voter model including random changes of state. The proposed method is able to unfold the dependence of the model not only on the mean degree (the mean-field prediction) but also on more complex averages over the degree distribution. In particular, we find that the degree heterogeneity--variance of the underlying degree distribution--has a strong influence on the location of the critical point of a noise-induced, finite-size transition occurring in the model, on the local ordering of the system, and on the functional form of its temporal correlations. Finally, we show how this latter point opens the possibility of inferring the degree heterogeneity of the underlying network by observing only the aggregate behavior of the system as a whole, an issue of interest for systems where only macroscopic, population level variables can be measured.

No MeSH data available.


Related in: MedlinePlus