We couple projective limits of probability measures to direct limits of their symmetry groups. We show that the direct limit group is the group of symmetries of the projective limit probability measure. If projective systems of probability measures represent point processes in increasingly larger finite regions of the same infinite space, then we show that under some additional niceness and consistency assumptions, an extension of the direct limit group is the symmetry group of the projective limit point process in the whole infinite space. The application of these results to random graph limits provides ``shortest paths'' to graphons and graphexes as it recovers these random graph limits as trivial corollaries. Another application example encompasses a broad class of limits of random graphs with bounded average degrees. This class includes a representative collection of paradigmatic random graph models that have attracted significant research attention in diverse areas of science. Our approach thus provides a general unified framework to study limits of very different types of random graphs.