Implementations of algorithms to test (graph clustering) partition stability
The provided code implements the algorithms, which are given in pseudocode, presented by Ball and Geyer-Schulz (2018). At the moment we provide code written in Python and R.
You are free to use the provided code in your own work but if you do, we encourage you to cite the reference below.
There is a documentation for the Python implementation available under https://KIT-IISM-EM.github.io/partitionstability/html/. The documentation for the R code can be found under in the directory R/partitionstability.pdf
Ball, Fabian and Geyer-Schulz, Andreas (2018), “Symmetry-based Graph Clustering Partition Stability”, Archives of Datascience, Series A 4(1), DOI: 10.5445/KSP/1000085951/01