The paper introduces MGHRL, a framework for hypergraph representation learning that adapts hyperedge granularity through a granular-ball splitting strategy. It constructs hyperedges at multiple levels of detail, capturing high-order relationships tailored to the graph’s topology. A multi-granularity hypergraph network then processes these hyperedges with sub-networks and hierarchical reversible connections, achieving superior performance on benchmark datasets.
By Sen Zhao, Yifan Guan, Jinyuan Ni, Gaojie Xu, Zhang Xu, Xiaoyu Lian, Yi Liu, Yi Wang, Wei Wang
arXiv:2607. 29115v1 Announce Type: cross Abstract: Link prediction aims to identify potential or future connections within a given graph structure.
By Sen Zhao, Cheng Liu, Shuyin Xia, Zhiyuan Liu, Yi Liu, Yi Wang, Wei Wang
arXiv:2601. 21207v4 Announce Type: replace-cross Abstract: Combinatorial and topological structures, such as graphs, simplicial complexes, and cell complexes, form the foundation of geometric and topological deep learning (GDL and TDL) architectures.
By Chuan-Shen Hu
arXiv:2607. 28259v1 Announce Type: new Abstract: We introduce Topoformer, a lightweight and scalable framework for graph representation learning that encodes topological structure into attention-friendly sequences.
By Md Joshem Uddin, Astrit Tola, Cuneyt Gurcan Akcora, Baris Coskunuzer
Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn graph representations. However, their discriminative...
arXiv:2609.08152v1 Announce Type: new
Abstract: Graph representation learning has largely focused on designing increasingly sophisticated models to transform graph topology into vector representation...
By Meng Qin, Jinqiang Cui, Hongwei Zheng, Weihua Li, Sen Pei
arXiv:2609.17061v1 Announce Type: cross
Abstract: Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn g...
By Sanyam Sanjay Jain, Anshika Krishnatray, Aditya Sharma, Vinti Agarwal
arXiv:2605. 28209v2 Announce Type: replace Abstract: Graph clustering is essential in graph analysis for revealing structural patterns and node communities.
By Lei Zhang, Fubo Sun, Haipeng Yang, Zhong Guan, Likang Wu
arXiv:2607. 21381v1 Announce Type: new Abstract: Instance-level explanations aim to reveal the rationale behind a model's decisions for a specific graph.
By Jiancu Chen, Shuyin Xia, Guan Wang, Degang Chen, Fan Chen
The paper demonstrates that high‑quality graph embeddings can be produced without complex models or training by propagating random features through topological structures derived from random walks and anonymous walks. These training‑free embeddings capture node proximity and structural roles, respectively, and perform competitively on node, edge, and graph tasks while often requiring less computation. Combining the two embedding types further improves inference quality for some tasks.
arXiv:2606. 09051v1 Announce Type: new Abstract: Convolutions have successfully transitioned from image processing to the complex realm of non-Euclidean higher-order domains, particularly in hypergraphs.
By Fuli Wang, Wei Qian, Daniel L. Lau, Gonzalo R. Arce
arXiv:2506. 01467v4 Announce Type: replace Abstract: Graph generative models perform well on small-scale structured data but struggle to scale to large, complex structures.
By Dorian Gailhard, Enzo Tartaglione, Lirida Naviner, Jhony H. Giraldo