The aim of this paper is to examine the large-scale behavior of dynamical optimal transport on stationary random graphs embedded in $\R^n$. Our primary contribution is a stochastic homogenization result that characterizes the effective behavior of the discrete problems in terms of a continuous optimal transport problem, where the homogenized energy density results from the geometry of the discrete graph.