Consistency landscape of network communities
Daekyung Lee, Sang Hoon Lee, Beom Jun Kim, Heetae Kim

TL;DR
This paper introduces a framework to analyze the stability and reliability of community detection in networks by examining the consistency landscape across different resolutions, addressing the challenge of choosing appropriate community scales.
Contribution
It proposes a novel method leveraging consistency measures to quantify community structure reliability across resolutions, improving upon heuristic approaches.
Findings
Effectively visualizes community structure stability
Identifies optimal community resolutions in synthetic and real networks
Provides insights into fundamental properties of network communities
Abstract
The concept of community detection has long been used as a key device for handling the mesoscale structures in networks. Suitably conducted community detection reveals various embedded informative substructures of network topology. However, regarding the practical usage of community detection, it has always been a tricky problem to assign a reasonable community resolution for networks of interest. Because of the absence of the unanimously accepted criterion, most of the previous studies utilized rather ad hoc heuristics to decide the community resolution. In this work, we harness the concept of consistency in community structures of networks to provide the overall community resolution landscape of networks, which we eventually take to quantify the reliability of detected communities for a given resolution parameter. More precisely, we exploit the ambiguity in the results of stochastic…
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.
