- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper proposes a new quality function for soft clustering based on Markov Stability (MS). Spectral clustering algorithms are used for optimising the new quality function and applications on synthetic and real-world data show that the method can capture core-periphery structure.
Critical strengths
- The paper deals with the important problem of extending the MS framework to soft clustering.
Critical weaknesses
- The paper fails to demonstrate that existing variants of Markov Stability are not suitable for the clustering tasks considered. Similarly, lines 46 to 53 are not backed up by experiments or references.
- The paper does not engage sufficiently with related literature. Note that the authors of MS have proposed a soft clustering method called Severability (Yu et al., 2020), which has been used for soft-clustering in semantic networks as part of the LGDE method and was shown to outperform other overlapping community detection methods (Schindler et al., 2025). As Severability is the closest to an extension of MS to soft clustering, the proposed method should be compared to it theoretically/numerically. In my opinion, the advantage of Severability over the proposed method is that the former is a fully local approach to community detection and has theoretical guarantees in terms of local time scale separation.
- The intuition behind the proposed quality function is not well explained. Please motivate your core definition 2.2. Why did you change the null model? What are the important differences to MS? Compare this also to the quality function proposed in the Severability paper.
- How do you select the robust scales for the different clusters? Do you have global time scale separation, i.e., there is a scale for which all clusters are robust descriptions of the data, or local time scale separation as in Severability? Why is it sufficient to fix in the experiments?
- Section 4 is not sufficiently motivated. Does this section propose a downstream task? The experiments suggest that measuring core-periphery structure is the key contribution of the proposed method. However, in the introduction you argue that extending MS to soft clustering is the contribution of your paper, and in that case your tasks should establish that your method is better than baselines on appropriate clustering tasks, see below.
- The experimental validation is very limited (classification task on 150 SBM graphs with N=500 nodes each). It would be good to benchmark the proposed method against relevant baseline methods (Markov Stability, Severability, local Modularity etc.) on graphs with various structures and sizes using cluster comparison indices such as extensions of the Rand index for soft clustering, see Denœux et al. (2017).
Questions for authors
- Can your method be applied to directed graphs?
- Could your method be integrated in the PyGenStability framework (Arnaudon et al., 2024) for Markov Stability analysis?
2 comments
Dear authors, thanks for your answers to my questions. Unfortunately, you have not responded to the critical weaknesses I flagged in my review. Without thorough engagement with my review I cannot raise my scores.
We thank the reviewer for their detailed feedback, which we will incorporate as we revise this manuscript. We address your questions below.
Q1 - On directed graphs
Yes. There are variants of Markov Stability for directed graphs. One could extend these variants to soft partitioning similarly to the undirected setting. We agree that this is a useful future consideration.
Q2 - On PyGenStability
PyGenStability uses the Louvain method for identifying optimal partitions, which is not amenable to our framework.
We once again thank the reviewer for their time and feedback.