Scaling Higher-Order Graph Learning with Maximal Clique Complexes
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914617876283392 |
|---|---|
| author | Vialle, Antoine Einizade, Aref Malliaros, Fragkiskos D. Giraldo, Jhony H. |
| author_facet | Vialle, Antoine Einizade, Aref Malliaros, Fragkiskos D. Giraldo, Jhony H. |
| contents | Graph neural networks (GNNs) are limited to modeling pairwise interactions, while higher-order models based on cell complexes achieve greater expressivity but often suffer from poor scalability. We introduce simplified and factored cellular Weisfeiler Leman tests (sCWL and fCWL), which preserve the expressivity of the CWL test while improving computational efficiency. We further introduce the maximal clique complex, enabling scalable CWNs with reduced time and memory complexity while retaining strong empirical performance. To avoid explicit clique enumeration, we propose CliqueWalk, a biased random walk that samples maximal cliques and scales linearly with graph size. These contributions yield a scalable topological learning framework for higher-order graph representation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_31373 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Scaling Higher-Order Graph Learning with Maximal Clique Complexes Vialle, Antoine Einizade, Aref Malliaros, Fragkiskos D. Giraldo, Jhony H. Machine Learning Artificial Intelligence 68T07, 05C85, 68R10 I.2.6; G.2.2 Graph neural networks (GNNs) are limited to modeling pairwise interactions, while higher-order models based on cell complexes achieve greater expressivity but often suffer from poor scalability. We introduce simplified and factored cellular Weisfeiler Leman tests (sCWL and fCWL), which preserve the expressivity of the CWL test while improving computational efficiency. We further introduce the maximal clique complex, enabling scalable CWNs with reduced time and memory complexity while retaining strong empirical performance. To avoid explicit clique enumeration, we propose CliqueWalk, a biased random walk that samples maximal cliques and scales linearly with graph size. These contributions yield a scalable topological learning framework for higher-order graph representation. |
| title | Scaling Higher-Order Graph Learning with Maximal Clique Complexes |
| topic | Machine Learning Artificial Intelligence 68T07, 05C85, 68R10 I.2.6; G.2.2 |
| url | https://arxiv.org/abs/2605.31373 |