Browse Code
The goal of this project is to help readers understand and utilize the algorithm presented in our paper (http://arxiv.org/abs/1309.6605). These scripts use Sage to find symmetries and clusters in networks, and compute the transformation matrix to irreducible representation coordinates.
I will try to update these codes to be more useful in the coming months. I welcome feedback, and will try to fix bugs and add features accordingly.
Disclaimer: I make no guarantee that my code will work for your purposes, whatever they are.
Follow Network Symmetries and Synchronization
Other Useful Business Software
Go from Code to Production URL in Seconds
Skip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
Rate This Project
Login To Rate This Project
User Reviews
-
Overall I am very impressed. I did just want to note that using Ubuntu 14.04 and sage 7.2 I was not able to run your code as published. In order to get it to run I had to change get_orbits to: def get_orbits(self): ''' Returns the orbits of automorphism group as a list of lists ''' if self._orbits==None: self._group,self._orbits = \ (sg.Graph(sg.Matrix(self._adjmat))).automorphism_group(orbits=True) return sg.copy(self._orbits)
