Learning Subgroup Relations Using Siamese Graph Neural Networks

• URL: http://arxiv.org/abs/2607.11140v1
• Date: Mon, 13 Jul 2026 06:20:25 GMT
• Title: Learning Subgroup Relations Using Siamese Graph Neural Networks
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Determining whether one finite group is isomorphic to a subgroup of another is a fundamental problem in computational group theory. In this work, we propose a Siamese Graph Neural Network (Siamese GNN) for subgroup prediction using Cayley graph representations of finite groups. Each input group is represented by its undirected Cayley graph and encoded by one branch of a Siamese GNN to produce a graph embedding. The resulting graph embeddings are combined with algebraic features derived directly from the input groups to construct a joint feature vector, which is processed by a fully connected classifier to predict subgroup relations between finite groups. By integrating graph-based structural representations with algebraic features, the proposed framework provides a unified approach for learning subgroup relations from finite groups. Experimental results demonstrate the effectiveness of the proposed architecture, achieving a test accuracy of 95.9% (47/49) on an independent test set and illustrating the potential of geometric deep learning for subgroup prediction.

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)
• A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks [0.0]
  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.
  arXiv  Detail & Related papers  (2026-06-24T17:37:16Z)
• Neural Networks Provably Learn Spectral Representations for Group Composition [51.637084292404616]
  We study how structured internal structure emerges during neural network training.<n>We prove that the training dynamics are governed by a gradient ascent on a representation-theoretic energy functional.<n>This framework provides a representation-theoretic account of feature learning and characterizes a novel low-rank compression phenomenon.
  arXiv  Detail & Related papers  (2026-06-02T01:04:21Z)
• 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)
• The Geometry of Polynomial Group Convolutional Neural Networks [0.805635934199494]
  We study group convolutional neural networks (PGCNNs) for an arbitrary finite group $G$.<n>We introduce a new mathematical framework for PGCNNs using the language of graded group algebras.
  arXiv  Detail & Related papers  (2026-03-31T10:49:12Z)
• From Polynomials to Databases: Arithmetic Structures in Galois Theory [0.0]
  We develop a framework for classifying Galois groups of irreducible degree-7s over$mathbbQ$, combining explicit resolvent methods with machine learning techniques.<n>A database of over one million normalizedive project septics is constructed, each annotated with invariants$J_0, dots, J_4$ derived from binary transvections.
  arXiv  Detail & Related papers  (2025-11-20T18:29:38Z)
• 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)
• Learning Spatial Context with Graph Neural Network for Multi-Person Pose Grouping [71.59494156155309]
  Bottom-up approaches for image-based multi-person pose estimation consist of two stages: keypoint detection and grouping. In this work, we formulate the grouping task as a graph partitioning problem, where we learn the affinity matrix with a Graph Neural Network (GNN) The learned geometry-based affinity is further fused with appearance-based affinity to achieve robust keypoint association.
  arXiv  Detail & Related papers  (2021-04-06T09:21:14Z)
• LieTransformer: Equivariant self-attention for Lie Groups [49.9625160479096]
  Group equivariant neural networks are used as building blocks of group invariant neural networks. We extend the scope of the literature to self-attention, that is emerging as a prominent building block of deep learning models. We propose the LieTransformer, an architecture composed of LieSelfAttention layers that are equivariant to arbitrary Lie groups and their discrete subgroups.
  arXiv  Detail & Related papers  (2020-12-20T11:02:49Z)
• NagE: Non-Abelian Group Embedding for Knowledge Graphs [14.545770519120898]
  We show that a group-based embedding framework is essential for designing embedding models. Motivated by theoretical analysis, we have proposed a group theory-based knowledge graph embedding framework. We provide a generic recipe to construct embedding models associated with two instantiating examples.
  arXiv  Detail & Related papers  (2020-05-22T00:54:45Z)
• 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)
• Can Graph Neural Networks Count Substructures? [53.256112515435355]
  We study the power of graph neural networks (GNNs) via their ability to count attributed graph substructures. We distinguish between two types of substructure counting: inducedsubgraph-count and subgraphcount-count, and both positive and negative answers for popular GNN architectures.
  arXiv  Detail & Related papers  (2020-02-10T18:53:30Z)

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.