Fig. 4
From: Graph-based data clustering via multiscale community detection
Robustness of the partitions found through Markov Stability for the CkNN graph with k=7 and δ=1.8 of the dataset in Fig. 3. a We show the one-dimensional MDS embedding (based on the VI distance) of all the graph partitions found by the nL Louvain optimisations for each of the nT Markov times. The partition with the maximal Markov Stability at each Markov time is labelled by a filled circle, whereas the non-optimal partitions are represented by open squares. The graph partitions are coloured according to the frequency of their appearance in the optimisations. b The Sankey diagram represents the relationship between the partitions found by MS across Markov time, from c=9 to c=3. Note the hierarchical structure which is not pre-imposed by the algorithm but emerges from the intrinsic properties of the dataset