菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-06-29
📄 Abstract - Curvature-Guided Sheaf Diffusion for Unsupervised Community Detection on Heterophilic Graphs

Detecting communities in heterophilic graphs -- where connected nodes often belong to different classes -- is hard for unsupervised methods: classical modularity and spectral methods are feature agnostic, while deep graph-clustering methods rely on contrastive or generative machinery that is opaque. We propose Curvature-Guided Sheaf Diffusion (CGSD), a fully unsupervised community-detection algorithm that uses the discrete Forman--Ricci curvature of each edge as its single topological signal, propagated through every stage of an end-to-end pipeline. CGSD makes three concrete contributions: (i)~a curvature-gated sheaf-diffusion encoder that gates edge messages by $\sigma(\kappa_e)$ and is trained from three label-free structural losses (modularity, anti-collapse, curvature-weighted reconstruction); (ii)~a curvature-aware spectral clusterer (CSpec) that re-weights the $k$-NN affinity of the embedding by $\sigma(\alpha \kappa_{e^*})$ before Ng--Jordan--Weiss; and (iii)~a unified label-free evaluation against nine truly-unsupervised baselines. On five heterophilic benchmarks (Cora, Cornell, Texas, Wisconsin, Chameleon), CGSD wins outright on Wisconsin and Chameleon and is competitive on the remaining three against nine unsupervised baselines. The gain over the strongest baseline is driven by the clusterer, not the encoder: on the same embedding, CSpec improves mean NMI from $0.091$ with $K$-Means to $0.107$ ($+15\%$, paired $t$-test $p=0.008$). The mechanism is interpretable: intra-community and inter-community curvature distributions are visibly separated. Code is open-sourced at this https URL.

顶级标签: machine learning graph
详细标签: community detection heterophilic graphs curvature sheaf diffusion unsupervised learning 或 搜索:

基于曲率引导的束扩散方法:用于异配图的非监督社区检测 / Curvature-Guided Sheaf Diffusion for Unsupervised Community Detection on Heterophilic Graphs


1️⃣ 一句话总结

本文提出一种完全无监督的社区检测算法CGSD,通过利用图中每条边的离散Forman-Ricci曲率作为唯一拓扑信号,结合曲率门控的束扩散编码器和曲率感知的谱聚类器,在异配图(即相连节点常属于不同类别)上实现了优于现有无监督方法的社区识别效果,且其内部机制清晰可解释。

源自 arXiv: 2606.30249