Before revision:  We illustrate this approach on oriented random graphs with a prescribed degree distribution and find that the leading eigenvalue is universal in the sense that it only depends on a few ensemble parameters, including the mean degree and a degree correlation coefficient.
After revision:  We illustrate this approach on oriented random graphs with a prescribed degree distribution and find that the leading eigenvalue is universal in the sense that it only depends on a few parameters, such as, the mean degree and a degree correlation coefficient.