Network Tight Community Detection
Jiayi Deng, Xiaodong Yang, Jun Yu, Jun Liu, Zhaiming Shen, Danyang Huang, Huimin Cheng
Abstract
Conventional community detection methods often categorize all nodes into clusters. However, the presumed community structure of interest may only be valid for a subset of nodes (named as "tight nodes"), while the rest of the network may consist of noninformative "scattered nodes". For example, a protein-protein network often contains proteins that do not belong to specific biological functional modules but are involved in more general processes, or act as bridges between different functional modules. Forcing each of these proteins into a single cluster introduces unwanted biases and obscures the underlying biological implication. To address this issue, we propose a tight community detection (TCD) method to identify tight communities excluding scattered nodes. The algorithm enjoys a strong theoretical guarantee of tight node identification accuracy and is scalable for large networks. The superiority of the proposed method is demonstrated by various synthetic and real experiments.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itRelated papers
- Provable Overlapping Community Detection in Weighted GraphsJimit Majmudar, Stephen A. VavasisNeurIPS 2020 · 5 citations
- Weighted Flow Diffusion for Local Graph Clustering with Node Attributes: an Algorithm and Statistical GuaranteesShenghao Yang, Kimon FountoulakisICML 2023 · 6 citations
- Semi-supervised Community Detection via Structural Similarity MetricsYicong Jiang, Tracy KeICLR 2023
- An Adaptive Sampling Algorithm for the Top- Group Betweenness CentralityWenzheng Xu, Honglin Mao, Heng Shao, Weifa Liang et al.ICDE 2025 · 3 citations
- Reliable Community Search on Uncertain GraphsXiaoye Miao, Yue Liu, Lu Chen, Yunjun Gao et al.ICDE 2022 · 18 citations
