Prioritizing network communities
Not on the map. Why?
Abstract (arXiv)
Uncovering modular structure in networks is fundamental for systems in biology, physics, and engineering. Community detection identifies candidate modules as hypotheses, which then need to be validated through experiments, such as mutagenesis in a biological laboratory. Only a few communities can typically be validated, and it is thus important to prioritize which communities to select for downstream experimentation. Here we develop CRank, a mathematically principled approach for prioritizing network communities. CRank efficiently evaluates robustness and magnitude of structural features of each community and then combines these features into the community prioritization. CRank can be used with any community detection method. It needs only information provided by the network structure and does not require any additional metadata or labels. However, when available, CRank can incorporate domain-specific information to further boost performance. Experiments on many large networks show that CRank effectively prioritizes communities, yielding a nearly 50-fold improvement in community prioritization.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 May 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 4; 2023: 4; 2024: 3; 2025: 1; 2026: 1.
14 papers.
Sort:
By area:
- 2022Universal Prompt Tuning for Graph Neural Networkscited by 100
- 2023Learning Strong Graph Neural Networks with Weak Informationcited by 25
- 2021Augmentations in Graph Contrastive Learning: Current Methodological Flaws & Towards Better Practicescited by 24
- 2022Decoupled Self-supervised Learning for Non-Homophilous Graphscited by 10
- 2023Graph Contrastive Learning with Generative Adversarial Networkcited by 8
- 2022Analyzing Data-Centric Properties for Graph Contrastive Learningcited by 7
- 2023Normalized mutual information is a biased measure for classification and community detectioncited by 7
- 2024Exploring Correlations of Self-Supervised Tasks for Graphscited by 7
- 2023Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by Identifying Important Nodes with Bridgenesscited by 4
- 2024A Unified Graph Selective Prompt Learning for Graph Neural Networkscited by 2
- 2022Federated Graph Representation Learning using Self-Supervisioncited by 0
- 2024Range-aware Positional Encoding via High-order Pretraining: Theory and Practicecited by 0
2 more
- 2025Quantum-Assisted Correlation Clusteringcited by 0
- 2026Research Assistant: AstraZeneca's Agentic System for R&Dcited by 0
- 2026Research Assistant: AstraZeneca's Agentic System for R&D6 Aug 2026
- 2025Quantum-Assisted Correlation Clustering3 Sep 2025
- 2024Range-aware Positional Encoding via High-order Pretraining: Theory and Practice27 Sep 2024
- 2024A Unified Graph Selective Prompt Learning for Graph Neural Networks15 Jun 2024
- 2024Exploring Correlations of Self-Supervised Tasks for Graphs7 May 2024
- 2023Graph Contrastive Learning with Generative Adversarial Network1 Aug 2023
- 2023Normalized mutual information is a biased measure for classification and community detection3 Jul 2023
- 2023Learning Strong Graph Neural Networks with Weak Information29 May 2023
- 2023Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by Identifying Important Nodes with Bridgeness24 Apr 2023
- 2022Federated Graph Representation Learning using Self-Supervision27 Oct 2022
- 2022Universal Prompt Tuning for Graph Neural Networks30 Sep 2022
- 2022Analyzing Data-Centric Properties for Graph Contrastive Learning4 Aug 2022
- 2026Research Assistant: AstraZeneca's Agentic System for R&Dcited by 0
- 2026Research Assistant: AstraZeneca's Agentic System for R&D6 Aug 2026
- 2022Universal Prompt Tuning for Graph Neural Networkscited by 100
- 2023Learning Strong Graph Neural Networks with Weak Informationcited by 25
- 2021Augmentations in Graph Contrastive Learning: Current Methodological Flaws & Towards Better Practicescited by 24
- 2022Decoupled Self-supervised Learning for Non-Homophilous Graphscited by 10
- 2023Graph Contrastive Learning with Generative Adversarial Networkcited by 8
- 2022Analyzing Data-Centric Properties for Graph Contrastive Learningcited by 7
- 2023Normalized mutual information is a biased measure for classification and community detectioncited by 7
- 2024Exploring Correlations of Self-Supervised Tasks for Graphscited by 7
- 2023Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by Identifying Important Nodes with Bridgenesscited by 4
- 2024A Unified Graph Selective Prompt Learning for Graph Neural Networkscited by 2
- 2022Federated Graph Representation Learning using Self-Supervisioncited by 0
- 2024Range-aware Positional Encoding via High-order Pretraining: Theory and Practicecited by 0
12 most cited of 13 All 13 (JSON)
- 2025Quantum-Assisted Correlation Clustering3 Sep 2025
- 2024Range-aware Positional Encoding via High-order Pretraining: Theory and Practice27 Sep 2024
- 2024A Unified Graph Selective Prompt Learning for Graph Neural Networks15 Jun 2024
- 2024Exploring Correlations of Self-Supervised Tasks for Graphs7 May 2024
- 2023Graph Contrastive Learning with Generative Adversarial Network1 Aug 2023
- 2023Normalized mutual information is a biased measure for classification and community detection3 Jul 2023
- 2023Learning Strong Graph Neural Networks with Weak Information29 May 2023
- 2023Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by Identifying Important Nodes with Bridgeness24 Apr 2023
- 2022Federated Graph Representation Learning using Self-Supervision27 Oct 2022
- 2022Universal Prompt Tuning for Graph Neural Networks30 Sep 2022
- 2022Analyzing Data-Centric Properties for Graph Contrastive Learning4 Aug 2022
- 2022Decoupled Self-supervised Learning for Non-Homophilous Graphs7 Jun 2022
12 newest of 13 All 13 (JSON)