Although function projective synchronization in complex dynamical networks has been extensively studied in the literature, few papers deal with the problem between two different complex networks with correlated random disturbances. In this paper, we present some novel techniques to analyze the problem of synchronization. A probability approach is introduced to obtain an almost sure synchronization criterion. We also present some efficient approaches to analyze the problem of exponential synchronization. For the problem of synchronization in some complex networks, our approaches not only can replace the LaSalle-type theorem but also allow improvements of existing results in the literature. Finally, some numerical examples are provided to demonstrate the effectiveness of the proposed approaches.