  We define a new measure of network symmetry that is capable of capturing
approximate global symmetries of networks. We apply this measure to different
networks sampled from several classic network models, as well as several
real-world networks. We find that among the network models that we have
examined, Erd\"os-R\'enyi networks have the least levels of symmetry, and
Random Geometric Graphs are likely to have high levels of symmetry. We find
that our network symmetry measure can capture properties of network structure,
and help us gain insights on the structure of real-world networks. Moreover,
our network symmetry measure is capable of capturing imperfect network
symmetry, which would have been undetected if only perfect symmetry is
considered.
