Generating Graphs with Symmetry

In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erdős-Rényi model or the Barabási-Albert model. Unfortunately, most graph generating algorithms do not typically create graphs with symmetries, which have been shown to have an important role on the network dynamics. Here, we present an algorithm to generate graphs with prescribed symmetries. The algorithm can also be used to generate graphs with a prescribed equitable partition but possibly without any symmetry. We also use our graph generator to examine the recently raised question about the relation between the orbits of the automorphism group and a graph's minimal equitable partition.

[1]  Francesco Sorrentino,et al.  Cluster synchronization and isolated desynchronization in complex networks with symmetries , 2013, Nature Communications.

[2]  D. Gale.  A theorem on flows in networks , 1957 .

[3]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Joos Vandewalle,et al.  Cluster synchronization in oscillatory networks. , 2008, Chaos.

[5]  SATORU KUDOSE,et al.  EQUITABLE PARTITIONS AND ORBIT PARTITIONS , 2009 .

[6]  Francesco Sorrentino,et al.  Complete characterization of the stability of cluster synchronization in complex dynamical networks , 2015, Science Advances.

[7]  J. Lauri,et al.  Topics in Graph Automorphisms and Reconstruction , 2003 .

[8]  R. Pastor-Satorras,et al.  Generation of uncorrelated random scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  R. Lougee-Heimer,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003 .

[10]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[11]  V N Belykh,et al.  Cluster synchronization modes in an ensemble of coupled chaotic oscillators. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[13]  Mauricio Barahona,et al.  Graph partitions and cluster synchronization in networks of oscillators , 2016, Chaos.

[14]  Ben D. MacArthur,et al.  Symmetry in complex networks , 2007, Discret. Appl. Math..

[15]  Vito Latora,et al.  Remote synchronization reveals network symmetries and functional modules. , 2012, Physical review letters.

[16]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[17]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[18]  Martin Hasler,et al.  Mesoscale and clusters of synchrony in networks of bursting neurons. , 2011, Chaos.

[19]  Louis Pecora,et al.  Symmetry- and input-cluster synchronization in networks. , 2018, Physical review. E.

[20]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[21]  Francesco Sorrentino,et al.  Symmetries in the time-averaged dynamics of networks: Reducing unnecessary complexity through minimal network models. , 2017, Chaos.

[22]  Mattia Frasca,et al.  Distributed Control of Synchronization of a Group of Network Nodes , 2019, IEEE Transactions on Automatic Control.

[23]  S. A. Choudum.  A simple proof of the Erdos-Gallai theorem on graph sequences , 1986, Bulletin of the Australian Mathematical Society.