Graph Neural Networks for Predicting Solvability of Finite Groups

• URL: http://arxiv.org/abs/2606.07619v1
• Date: Sat, 30 May 2026 08:34:26 GMT
• Title: Graph Neural Networks for Predicting Solvability of Finite Groups
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a Graph Neural Network (GNN) framework for the classification of finite groups according to their solvability. 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. The framework is evaluated on groups outside the training dataset in order to investigate the extent to which GNNs can learn algebraic properties arising in group theory. More broadly, the present work explores the relationship between algebraic structure and graph-based geometric representations of finite groups. The present study is intended as a proof-of-concept investigation of whether GNNs can learn algebraic properties of finite groups from graph-based representations

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)
• 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)
• 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)
• On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective [28.497567290882355]
  Graph Neural Networks (GNNs) have become the standard approach for learning and reasoning over relational data.<n>This paper explores the computational limitations of GNNs through the lens of circuit complexity.<n>Specifically, we analyze the circuit complexity of common GNN architectures and prove that under constraints of constant-depth layers, linear or sublinear embedding sizes, and precision, GNNs cannot solve key problems such as graph connectivity and graph isomorphism.
  arXiv  Detail & Related papers  (2025-01-11T05:54:10Z)
• LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering [59.89626219328127]
  Graph clustering is a fundamental problem in machine learning. Deep learning methods achieve the state-of-the-art results in recent years, but they still cannot work without predefined cluster numbers. We propose to address this problem from a fresh perspective of graph information theory.
  arXiv  Detail & Related papers  (2024-05-20T05:46:41Z)
• 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)
• Structural Explanations for Graph Neural Networks using HSIC [21.929646888419914]
  Graph neural networks (GNNs) are a type of neural model that tackle graphical tasks in an end-to-end manner. The complicated dynamics of GNNs make it difficult to understand which parts of the graph features contribute more strongly to the predictions. In this study, a flexible model agnostic explanation method is proposed to detect significant structures in graphs.
  arXiv  Detail & Related papers  (2023-02-04T09:46:47Z)
• Bispectral Neural Networks [1.0323063834827415]
  We present a neural network architecture, Bispectral Neural Networks (BNNs) BNNs are able to simultaneously learn groups, their irreducible representations, and corresponding equivariant and complete-invariant maps.
  arXiv  Detail & Related papers  (2022-09-07T18:34:48Z)
• GraphSVX: Shapley Value Explanations for Graph Neural Networks [81.83769974301995]
  Graph Neural Networks (GNNs) achieve significant performance for various learning tasks on geometric data. In this paper, we propose a unified framework satisfied by most existing GNN explainers. We introduce GraphSVX, a post hoc local model-agnostic explanation method specifically designed for GNNs.
  arXiv  Detail & Related papers  (2021-04-18T10:40:37Z)
• CommPOOL: An Interpretable Graph Pooling Framework for Hierarchical Graph Representation Learning [74.90535111881358]
  We propose a new interpretable graph pooling framework - CommPOOL. It can capture and preserve the hierarchical community structure of graphs in the graph representation learning process. CommPOOL is a general and flexible framework for hierarchical graph representation learning.
  arXiv  Detail & Related papers  (2020-12-10T21:14:18Z)
• Counting Substructures with Higher-Order Graph Neural Networks: Possibility and Impossibility Results [58.277290855841976]
  We study tradeoffs of computational cost and expressive power of Graph Neural Networks (GNNs) We show that a new model can count subgraphs of size $k$, and thereby overcomes a known limitation of low-order GNNs. In several cases, the proposed algorithm can greatly reduce computational complexity compared to the existing higher-order $k$-GNNs.
  arXiv  Detail & Related papers  (2020-12-06T03:42:54Z)
• Amortized Probabilistic Detection of Communities in Graphs [39.56798207634738]
  We propose a simple framework for amortized community detection. We combine the expressive power of GNNs with recent methods for amortized clustering. We evaluate several models from our framework on synthetic and real datasets.
  arXiv  Detail & Related papers  (2020-10-29T16:18:48Z)
• 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)
• 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.