Majority-vote model on directed Erdos-Renyi random graphs

TL;DR

This paper investigates the phase transition behavior of the majority-vote model with noise on directed Erdos-Renyi random graphs using Monte Carlo simulations, focusing on critical parameters and exponents as a function of graph connectivity.

Contribution

It provides a detailed characterization of the order-disorder phase transition, including critical noise and exponents, for the majority-vote model on directed random graphs.

Findings

Critical noise parameter $q_c$ varies with connectivity $z$.

Critical exponents $beta/nu$, $gamma/nu$, and $1/nu$ are calculated as functions of $z$.

The phase transition behavior depends on the graph's connectivity.

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.