A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks

• URL: http://arxiv.org/abs/2606.26212v1
• Date: Wed, 24 Jun 2026 17:37:16 GMT
• Title: A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks
• Abstract summary: We develop a property-independent framework for learning algebraic properties of finite groups directly from Cayley graphs.<n>We consider abelianity, nilpotency, and solvability as representative case studies.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A Graph Neural Network (GNN) framework for predicting the solvability of finite groups from their Cayley graph representations was introduced in [1]. In the present work, we generalize this approach and develop a property-independent framework for learning algebraic properties of finite groups directly from Cayley graphs. As representative case studies, we consider abelianity, nilpotency, and solvability. Using a common GNN architecture and training pipeline, we investigate the extent to which algebraic structure can be recovered from graph-based representations alone. Results on a collection of finite groups drawn from several families demonstrate that the framework successfully learns and distinguishes multiple algebraic properties from their associated Cayley graphs. These findings suggest that substantial algebraic information is encoded in graph representations and can be extracted through GNNs. More broadly, the proposed framework provides a proof of concept for applying graph representation learning to the study of algebraic properties of finite groups.

Related papers

• Learning the Graphical Nature of Symmetries [0.06841536467264132]
  Cayley graphs expose a rich network geometry through which group-theoretic structure can be measured, compared, and learned.<n>This census aims to provide novel benchmarks for studying how finite-group properties are reflected in Cayley graph observables.
  arXiv  Detail & Related papers  (2026-07-13T18:00:02Z)
• Learning Subgroup Relations Using Siamese Graph Neural Networks [0.0]
  We propose a Siamese Graph Neural Network (Siamese GNN) for subgroup prediction using Cayley graph representations of finite groups.<n>The proposed framework provides a unified approach for learning subgroup relations from finite groups.
  arXiv  Detail & Related papers  (2026-07-13T06:20:25Z)
• Graph Neural Networks for Predicting Solvability of Finite Groups [0.0]
  We present a Graph Neural Network (GNN) framework for the classification of finite groups according to their solvability.<n>Using graph representations associated with finite groups, including Cayley graphs (CG), the proposed model is trained to distinguish solvable and non-solvable groups using structural graph information alone.
  arXiv  Detail & Related papers  (2026-05-30T08:34:26Z)
• On the structural properties of Lie algebras via associated labeled directed graphs [0.0]
  We present a method for associating labeled directed graphs to finite-dimensional Lie algebras.<n>We analyze properties of valid graphs given the antisymmetry property of the Lie bracket as well as the Jacobi identity.<n>We develop graph-theoretic criteria for solvability, nilpotency, presence of ideals, simplicity, semisimplicity, and reductiveness of an algebra.
  arXiv  Detail & Related papers  (2026-01-22T18:09:16Z)
• Homomorphism Counts for Graph Neural Networks: All About That Basis [8.25219440625445]
  We argue for a more fine-grained approach, which incorporates the homomorphism counts of all structures in the basis'' of the target pattern. This yields strictly more expressive architectures without incurring any additional overhead in terms of computational complexity.
  arXiv  Detail & Related papers  (2024-02-13T16:57:06Z)
• From axioms over graphs to vectors, and back again: evaluating the properties of graph-based ontology embeddings [78.217418197549]
  One approach to generating embeddings is by introducing a set of nodes and edges for named entities and logical axioms structure. Methods that embed in graphs (graph projections) have different properties related to the type of axioms they utilize.
  arXiv  Detail & Related papers  (2023-03-29T08:21:49Z)
• On the Expressiveness and Generalization of Hypergraph Neural Networks [77.65788763444877]
  This extended abstract describes a framework for analyzing the expressiveness, learning, and (structural) generalization of hypergraph neural networks (HyperGNNs) Specifically, we focus on how HyperGNNs can learn from finite datasets and generalize structurally to graph reasoning problems of arbitrary input sizes.
  arXiv  Detail & Related papers  (2023-03-09T18:42:18Z)
• Representation Power of Graph Neural Networks: Improved Expressivity via Algebraic Analysis [124.97061497512804]
  We show that standard Graph Neural Networks (GNNs) produce more discriminative representations than the Weisfeiler-Lehman (WL) algorithm. We also show that simple convolutional architectures with white inputs, produce equivariant features that count the closed paths in the graph.
  arXiv  Detail & Related papers  (2022-05-19T18:40:25Z)
• Knowledgebra: An Algebraic Learning Framework for Knowledge Graph [15.235089177507897]
  Knowledge graph (KG) representation learning aims to encode entities and relations into dense continuous vector spaces such that knowledge contained in a dataset could be consistently represented. We developed a mathematical language for KG based on an observation of their inherent algebraic structure, which we termed as Knowledgebra. We implemented an instantiation model, SemE, using simple matrix semigroups, which exhibits state-of-the-art performance on standard datasets.
  arXiv  Detail & Related papers  (2022-04-15T04:53:47Z)
• Group Contrastive Self-Supervised Learning on Graphs [101.45974132613293]
  We study self-supervised learning on graphs using contrastive methods. We argue that contrasting graphs in multiple subspaces enables graph encoders to capture more abundant characteristics.
  arXiv  Detail & Related papers  (2021-07-20T22:09:21Z)
• Structural Landmarking and Interaction Modelling: on Resolution Dilemmas in Graph Classification [50.83222170524406]
  We study the intrinsic difficulty in graph classification under the unified concept of resolution dilemmas'' We propose SLIM'', an inductive neural network model for Structural Landmarking and Interaction Modelling.
  arXiv  Detail & Related papers  (2020-06-29T01:01:42Z)
• Embedding Graph Auto-Encoder for Graph Clustering [90.8576971748142]
  Graph auto-encoder (GAE) models are based on semi-supervised graph convolution networks (GCN) We design a specific GAE-based model for graph clustering to be consistent with the theory, namely Embedding Graph Auto-Encoder (EGAE) EGAE consists of one encoder and dual decoders.
  arXiv  Detail & Related papers  (2020-02-20T09:53:28Z)

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.