Scaling corrections of Majority Vote model on Barabasi-Albert networks
T. F. A. Alves, G. A. Alves, F. W. S. Lima, A. M. Filho

TL;DR
This paper investigates the critical behavior of the Majority Vote model on Barabasi-Albert networks, revealing universal exponents with logarithmic corrections, contrasting with previous non-universal findings.
Contribution
It generalizes scaling relations to include logarithmic corrections and demonstrates the universality of critical exponents for the Majority Vote model.
Findings
Critical exponents are universal and independent of network connectivity.
Majority Vote and Biswas-Chatterjee-Sen models share the same universality class.
Majority Vote model exhibits logarithmic corrections, unlike the Biswas-Chatterjee-Sen model.
Abstract
We consider two consensus formation models coupled to Barabasi-Albert networks, namely the Majority Vote model and Biswas-Chatterjee-Sen model. Recent works point to a non-universal behavior of the Majority Vote model, where the critical exponents have a dependence on the connectivity while the effective dimension of the lattice is unity. We considered a generalization of the scaling relations in order to include logarithmic corrections. We obtained the leading critical exponent ratios , , and by finite size scaling data collapses, as well as the logarithmic correction pseudo-exponents , , and . By comparing the scaling behaviors of the Majority Vote and Biswas-Chatterjee-Sen models, we argue that the exponents of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Opinion Dynamics and Social Influence · Theoretical and Computational Physics
