Majority-vote model on directed Erdos-Renyi random graphs
classification
❄️ cond-mat.stat-mech
physics.soc-ph
keywords
randombeencriticaldirectedgraphsmajority-votemodelnoise
read the original abstract
Through Monte Carlo Simulation, the well-known majority-vote model has been studied with noise on directed random graphs. In order to characterize completely the observed order-disorder phase transition, the critical noise parameter $q_c$, as well as the critical exponents $beta/nu$, $gamma/nu$ and $1/nu$ have been calculated as a function of the connectivity $z$ of the random graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.