Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1908.00660

Pair approximation for the $q$-voter model with independence on multiplex networks

Tomasz Gradowski·Andrzej Krawiecki
View original source ↗Read source document ↗Export metadata ↓

Abstract

The $q$-voter model with independence is investigated on multiplex networks with fully overlapping layers in the form of various complex networks corresponding to different levels of social influence. Detailed studies are performed for the model on multiplex networks with two layers with identical degree distributions, obeying the LOCAL&AND and GLOBAL&AND spin update rules differing by the way in which the $q$-lobbies of neighbors within different layers exert their joint influence on the opinion of a given agent. Homogeneous pair approximation is derived for a general case of a two-state spin model on a multiplex network and its predictions are compared with results of Monte Carlo simulations of the above-mentioned $q$-voter model with independence for a broad range of parameters. As the parameter controlling the level of agents' independence is changed ferromagnetic phase transition occurs which can be first- or second-order, depending on the size of the lobby $q$. Details of this transition, e.g., position of the critical points, depend on the topology and other features, e.g., the mean degree of nodes of the layers. If the mean degree of nodes in the layers is substantially larger than the size of the $q$-lobby good agreement is obtained between numerical results and theoretical predictions based on the homogeneous pair approximation concerning the order and details of the ferromagnetic transition. In the case of the model on multiplex networks with layers in the form of homogeneous Erdo\"s-R\'enyi and random regular graphs as well as weakly heterogeneous scale-free networks this agreement is quantitative, while in the case of layers in the form of strongly heterogeneous scale-free networks it is only qualitative. If the mean degree of nodes is small and comparable with $q$ predictions of the homogeneous PA are in general even qualitatively wrong.

Explore related subjects

cond-mat.stat-mech

Keep this discovery

BibTeXRIS

Tomasz Gradowski, Andrzej Krawiecki. 2019-08-01. Pair approximation for the $q$-voter model with independence on multiplex networks. https://doi.org/10.1103/physreve.102.022314

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗
arXiv2026

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech↗
arXiv2026

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech↗