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.

Project Activity

See All Activity >

Follow Network Symmetries and Synchronization

Network Symmetries and Synchronization Web Site

Other Useful Business Software
Full-stack observability with actually useful AI | Grafana Cloud Icon
Full-stack observability with actually useful AI | Grafana Cloud

Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
Create free account
Rate This Project
Login To Rate This Project

User Ratings

★★★★★
★★★★
★★★
★★
0
1
0
0
0
ease 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
features 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
design 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
support 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5

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)
Read more reviews >

Additional Project Details

Registered

2014-05-20