Stability of Maximum likelihood based clustering methods: exploring the backbone of classifications (Who is keeping you in that community?)
Muhittin Mungan, Jose J. Ramasco

TL;DR
This paper introduces a stability analysis method for maximum likelihood clustering in networks, identifying key nodes that influence community structure and are resilient to network changes.
Contribution
It develops a stability analysis framework for MLE-based clustering, highlighting influential nodes and their roles in community robustness.
Findings
Identifies nodes critical for community stability.
Provides a method to quantify node influence in networks.
Demonstrates approach on empirical network data.
Abstract
Components of complex systems are often classified according to the way they interact with each other. In graph theory such groups are known as clusters or communities. Many different techniques have been recently proposed to detect them, some of which involve inference methods using either Bayesian or Maximum Likelihood approaches. In this article, we study a statistical model designed for detecting clusters based on connection similarity. The basic assumption of the model is that the graph was generated by a certain grouping of the nodes and an Expectation Maximization algorithm is employed to infer that grouping. We show that the method admits further development to yield a stability analysis of the groupings that quantifies the extent to which each node influences its neighbors group membership. Our approach naturally allows for the identification of the key elements responsible for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Bayesian Methods and Mixture Models · Advanced Clustering Algorithms Research
