Networks of coupled nonlinear oscillators have been used to model circadian rhythms, flashing fireflies, Josephson junction arrays, high-voltage electric grids, and many other kinds of self-organizing systems. Recently, several authors have sought to understand how coupled oscillators behave when they interact according to a random graph. Here we consider interaction networks generated by a graphon model known as a $W$-random network, and examine the dynamics of an infinite number of identical phase oscillators. We show that with sufficient regularity on $W$, the solution to the dynamical system over a $W$-random network of size $n$ converges in the $L^{\infty}$ norm to the solution of the infinite graphon system, with high probability as $n\rightarrow\infty$. We leverage this convergence result to explore synchronization for two classes of identical phase oscillators on Erdős-Rényi random graphs. This result suggests a framework for studying synchronization properties in large but finite random networks.