A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks
Summary
This paper presents a general framework for using Graph Neural Networks to learn algebraic properties from Cayley graphs, offering a new approach to algebraic reasoning with GNNs.
View Cached Full Text
Cached at: 06/26/26, 05:16 AM
# A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks Source: [https://arxiv.org/abs/2606.26212](https://arxiv.org/abs/2606.26212) Bibliographic Tools ## Bibliographic and Citation Tools Bibliographic Explorer Toggle Code, Data, Media ## Code, Data and Media Associated with this Article Demos ## Demos Related Papers ## Recommenders and Search Tools IArxiv recommender toggle About arXivLabs ## arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website\. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy\. arXiv is committed to these values and only works with partners that adhere to them\. Have an idea for a project that will add value for arXiv's community?[**Learn more about arXivLabs**](https://info.arxiv.org/labs/index.html)\.
Similar Articles
Graph Neural Networks for Predicting Solvability of Finite Groups
This paper applies graph neural networks to predict the solvability of finite groups, demonstrating an AI-driven approach to a classic problem in group theory.
Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching
This paper proposes LLM-GNN Co-Teaching, a bidirectional framework for few-shot graph learning on text-attributed graphs. The LLM and GNN exchange confident pseudo-labels and use round-based preference optimization (RPL-PO) to mutually improve, outperforming prior methods on benchmarks.
Structural Preservation and the Logical Expressiveness of Graph Neural Networks
This paper establishes a semantic framework linking graph neural network classifiers to fragments of graded modal logic, showing that preservation under structural properties like embeddings and homomorphisms corresponds to specific logical fragments. It provides characterizations independent of architectural choices and demonstrates that each class admits a GNN architecture of equivalent expressiveness.
Belief or Circuitry? Causal Evidence for In-Context Graph Learning
This paper investigates whether LLMs learn in-context through latent structure inference or local pattern matching, using mechanistic interpretability methods like PCA and activation patching on a graph random-walk task.
A Unified Perspective for Learning Graph Representations Across Multi-Level Abstractions
This paper proposes a unified contrastive framework for learning graph representations across multiple abstraction levels (node, proximity, cluster, graph) with a parameter-free self-weighting mechanism that adaptively assigns weights to similarity scores, outperforming state-of-the-art on downstream tasks like classification, clustering, and link prediction.