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 $D_mathrm{eff} = 2beta/ u + gamma/ u$ 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 $1/ u$, $beta/ u$, and $gamma/ u$ by finite size scaling data collapses, as well as the logarithmic correction pseudo-exponents $widehat{lambda}$, $widehat{beta}+betawidehat{lambda}$, and $widehat{gamma}-gammawidehat{lambda}$. By comparing the scaling behaviors of the Majority Vote and Biswas-Chatterjee-Sen models, we argue that the exponents of Majority Vote model, in fact, are universal. Therefore, they do not depend on network connectivity. In addition, the critical exponents and the universality class are the same of Biswas-Chatterjee-Sen model, as seen for periodic and random graphs. However, the Majority Vote model has logarithmic corrections on its scaling properties, while Biswas-Chatterjee-Sen model follows usual scaling relations without logarithmic corrections.
تحميل البحث