vix.ing · top · new · best · stats · spec

Pair approximation for theq-voter model with independence on complex networks

2016/07/31 by Arkadiusz Jędrzejewski · 1 citation
Mathematics · Physics and Astronomy · #Algorithm #Cluster analysis #Clustering coefficient #Complex Network Analysis Techniques #Degree (music) #Discrete mathematics #Graph #Independence (probability theory) #Limiting #Mathematics #Monte Carlo method #Opinion Dynamics and Social Influence #Physics #Statistics #Theoretical and Computational Physics #Voter model #cond-mat.stat-mech #physics.soc-ph

paper · pdf · doi:10.1103/physreve.95.012307

published as Phys. Rev. E 95, 012307 (2017) · 9 pages, 9 figures, corrected typos, extended section VI, replaced Fig. 5. with the correct one

openalex created_date 2016/08/23 · openalex publication_date 2017/01/10 · arxiv created 2018/04/30 · arxiv updated 2018/05/01 · openalex updated_date 2026/08/05

Abstract

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 point. The analytical results are validated by carrying out Monte Carlo experiments. The pair approximation prediction exhibits substantial agreement with simulations, especially for networks with weak clustering and large average degree. Nonetheless, for the average degree close to q, some discrepancies originate. It is the first time we are aware of that the presented approach has been applied to the nonlinear voter dynamics with noise. Up till now, the analytical results have been obtained only for a complete graph. We show that in the limiting case the prediction of pair approximation coincides with the known solution on a fully connected network.

Citations

Cited by