Graph Neural Network leveraging Higher-order Class Label Connectivity for Heterophilous Graphs

Most graph neural networks were designed with a convenient but often false assumption: that connected nodes tend to be similar. In real-world networks — social platforms, biological interaction graphs, citation networks — this homophily assumption frequently breaks down. Nodes of entirely different types are connected precisely because of their differences. LCC tackles this by capturing richer patterns of how different class labels co-occur across longer network paths. Applications are broad and consequential: fraud detection networks where fraudsters connect to legitimate accounts, protein interaction graphs where diverse proteins form functional complexes, and recommendation systems where complementary rather than similar items cluster together. Authors: Takuto Takahashi, Itsuki Nakayama, Takahiro Mitani, Ryosuke Kikuchi, Yuya Sasaki, Makoto Onizuka Paper: https://arxiv.org/abs/2606.07475v1