Majority-vote model on random graphs
Luiz F. C. Pereira, F. G. Brady Moreira
Abstract
The majority-vote model with noise on random graphs has been studied. Monte Carlo simulations were performed to characterize the order-disorder phase transition appearing in the system. We found that the value of the critical noise parameter is an increasing function of the mean connectivity of the random graph. The critical exponents beta/nu, gamma/nu and 1/nu were calculated for several values of z, and our analysis yielded critical exponents satisfying the hyperscaling relation with effective dimensionality equal to unity.
Create a lesson
Related papers
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov
Replica Transition at Measurement-Altered Ising Criticality
Kabir Khanna, Sara Murciano, Romain Vasseur
Scalene Yang-Baxter triples realize all nearest-neighbour Hamiltonians with global additive symmetries
Pramod Padmanabhan, Somnath Maity, Akash Sinha et al.
Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
Julian Voits
Spectral optimization of spherical lattices and applications to classical and quantum interacting spin systems
Jonas Völler, Grigorios Makris, Fabian Hassler et al.
Entropic-ordered superfluid
Isabella Zane, Andrew Lucas