Curvature-Guided Sheaf Diffusion for Unsupervised Community Detection on Heterophilic Graphs

• URL: http://arxiv.org/abs/2606.30249v2
• Date: Sun, 05 Jul 2026 14:02:59 GMT
• Title: Curvature-Guided Sheaf Diffusion for Unsupervised Community Detection on Heterophilic Graphs
• Abstract summary: Curvature-Guided Sheaf Diffusion is a fully unsupervised community-detection algorithm.<n>Uses the discrete Forman--Ricci curvature of each edge as its single topological signal.<n>On five heterophilic benchmarks, CGSD wins outright on Wisconsin and Chameleon.
• Score: 3.7082032592028207
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 $σ(κ_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 $σ(ακ_{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 https://github.com/woodywff/cgsd.

Related papers

• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• Multi-Modal Spatio-Temporal Graph Neural Network with Mixture of Experts for Soil Organic Carbon Prediction [0.0]
  Existing approaches face two limitations: they pair hand-crafted co-modals with classical ML or single-modal deep models that miss rich spectral and temporal information.<n>We introduce SpTG-NN, a multi-temporal graph neural network addressing both SpTGNN and grid-based architectures.<n>A fine-tuned TerraMind encoder extracts node features from Sentinel-2, Sentinel-1 and DEM signals.
  arXiv  Detail & Related papers  (2026-06-15T11:25:38Z)
• Three Costs of Amortizing Gaussian Process Inference with Neural Processes [0.0]
  Neural processes amortize Gaussian process inference, replacing the exact $O(n3)$ posterior with a learned $O(n)$ map from context sets to predictive distributions.<n>For a class of latent neural processes, we bound the Kullback--Leibler (KL) divergence between the GP and LNPs, decomposing it into three interpretable sources.<n>These results characterize the costs of amortization within the analyzed class and yield architectural recommendations to predict variance from context locations alone in the GP-amortization regime.
  arXiv  Detail & Related papers  (2026-05-20T22:48:23Z)
• Predictive Maps of Multi-Agent Reasoning: A Successor-Representation Spectrum for LLM Communication Topologies [0.0]
  Existing evaluation answers these questions only post hoc and only for the task measured.<n>We introduce a structural diagnostic for multi-agent LLM communication graphs based on the successor representation $M = (I - P)-1$ of the row-stochastic communication operator.<n>We derive closed-form spectra for the chain, star, and mesh under row-stochastic normalization, and validate the predictions on a 12-step structured state-tracking task.
  arXiv  Detail & Related papers  (2026-05-12T03:11:39Z)
• A Closed-Form Persistence-Landmark Pipeline for Certified Point-Cloud and Graph Classification [0.0]
  PLACE (Persistence-Landmark Analytic Classification Engine) is a closed-form pipeline for classifying point clouds and graphs.<n>Three quantitative guarantees -- a margin-based excess-risk rate, a closed-form descriptor-selection rule, and a per-prediction certificate -- are derived from training labels alone.
  arXiv  Detail & Related papers  (2026-05-04T17:15:01Z)
• Near-Optimal Clustering in Mixture of Markov Chains [74.3828414695655]
  We study the problem of clustering $T$ trajectories of length $H$, each generated by one of $K$ unknown ergodic Markov chains over a finite state space of size $S$.<n>We derive an instance-dependent, high-probability lower bound on the clustering error rate, governed by the weighted KL divergence between the transition kernels of the chains.<n>We then present a novel two-stage clustering algorithm.
  arXiv  Detail & Related papers  (2025-06-02T05:10:40Z)
• A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection [60.09453163562244]
  We propose a Heterophily-guided Unsupervised Graph fraud dEtection approach (HUGE) for unsupervised GFD.<n>In the estimation module, we design a novel label-free heterophily metric called HALO, which captures the critical graph properties for GFD.<n>In the alignment-based fraud detection module, we develop a joint-GNN architecture with ranking loss and asymmetric alignment loss.
  arXiv  Detail & Related papers  (2025-02-18T22:07:36Z)
• Exact Certification of (Graph) Neural Networks Against Label Poisoning [50.87615167799367]
  We introduce an exact certification method for label flipping in Graph Neural Networks (GNNs)<n>We apply our method to certify a broad range of GNN architectures in node classification tasks.<n>Our work presents the first exact certificate to a poisoning attack ever derived for neural networks.
  arXiv  Detail & Related papers  (2024-11-30T17:05:12Z)
• A Unified Framework for Center-based Clustering of Distributed Data [46.86543102499174]
  We develop a family of distributed center-based clustering algorithms that work over networks of users. Our framework allows for a broad class of smooth convex loss functions, including popular clustering losses like $K$-means and Huber loss. For the special case of Bregman losses, we show that our fixed points converge to the set of Lloyd points.
  arXiv  Detail & Related papers  (2024-02-02T10:44:42Z)
• Alleviating Structural Distribution Shift in Graph Anomaly Detection [70.1022676681496]
  Graph anomaly detection (GAD) is a challenging binary classification problem. Gallon neural networks (GNNs) benefit the classification of normals from aggregating homophilous neighbors. We propose a framework to mitigate the effect of heterophilous neighbors and make them invariant.
  arXiv  Detail & Related papers  (2024-01-25T13:07:34Z)
• Understanding Heterophily for Graph Neural Networks [42.640057865981156]
  We present theoretical understandings of the impacts of different heterophily patterns for Graph Neural Networks (GNNs) We show that the separability gains are determined by the normalized distance of the $l$-powered neighborhood distributions. Experiments on both synthetic and real-world data verify the effectiveness of our theory.
  arXiv  Detail & Related papers  (2024-01-17T11:01:28Z)
• Mixed Graph Contrastive Network for Semi-Supervised Node Classification [63.924129159538076]
  We propose a novel graph contrastive learning method, termed Mixed Graph Contrastive Network (MGCN)<n>In our method, we improve the discriminative capability of the latent embeddings by an unperturbed augmentation strategy and a correlation reduction mechanism.<n>By combining the two settings, we extract rich supervision information from both the abundant nodes and the rare yet valuable labeled nodes for discriminative representation learning.
  arXiv  Detail & Related papers  (2022-06-06T14:26:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.