SearcharxivSearch

arXiv · 2309.06510

$Q$-voter model with independence on signed random graphs: homogeneous approximations

Abstract

The $q$-voter model with independence is generalized to signed random graphs and studied by means of Monte Carlo simulations and theoretically using the mean field approximation and different forms of the pair approximation. In the signed network with quenched disorder, positive and negative signs associated randomly with the links correspond to reinforcing and antagonistic interactions, promoting, respectively, the same or opposite orientations of two-state spins representing agents' opinions; otherwise, the opinions are called mismatched. With probability $1-p$, the agents change their opinions if the opinions of all members of a randomly selected $q$-neighborhood are mismatched, and with probability $p$, they choose an opinion randomly. The model on networks with finite mean degree $\langle k \rangle$ and fixed fraction of the antagonistic interactions $r$ exhibits ferromagnetic transition with varying the independence parameter $p$, which can be first- or second-order, depending on $q$ and $r$, and disappears for large $r$. Besides, numerical evidence is provided for the occurrence of the spin-glass-like transition for large $r$. The order and critical lines for the ferromagnetic transition on the $p$ vs. $r$ phase diagram obtained in Monte Carlo simulations are reproduced qualitatively by the mean field approximation. Within the range of applicability of the pair approximation, for the model with $\langle k \rangle$ finite but $\langle k \rangle \gg q$, predictions of the homogeneous pair approximation concerning the ferromagnetic transition show much better quantitative agreement with numerical results for small $r$ but fail for larger $r$. A more advanced signed homogeneous pair approximation is formulated which distinguishes between classes of active links with a given sign connecting nodes occupied by agents with mismatched opinions...

Explore related subjects

Keep this discovery

BibTeXRIS

Andrzej Krawiecki, Tomasz Gradowski. 2023-09-12. $Q$-voter model with independence on signed random graphs: homogeneous approximations. https://doi.org/10.1103/physreve.109.014302

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

KEEP EXPLORING

Related papers

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

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

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