Abstract
Symmetry in graphs which describe the underlying topology of networked dynamical systems plays an essential role in the emergence of clusters of synchrony. Many real networked systems have a very large number of symmetries. Often one wants to test new results on large sets of random graphs that are representative of the real networks of interest. Unfortunately, existing graph generating algorithms will seldom produce graphs with any symmetry and much less ones with desired symmetry patterns. Here, we present an algorithm that is able to generate graphs with any desired symmetry pattern. The algorithm can be coupled with other graph generating algorithms to tune the final graph's properties of interest such as the degree distribution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Chaos: An Interdisciplinary Journal of Nonlinear Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
