Graph Neural Network Approach to Predicting Magnetization in Quasi-One-Dimensional Ising Systems

• URL: http://arxiv.org/abs/2507.17509v1
• Date: Wed, 23 Jul 2025 13:47:38 GMT
• Title: Graph Neural Network Approach to Predicting Magnetization in Quasi-One-Dimensional Ising Systems
• Authors: V. Slavin, O. Kryvchikov, D. Laptev,
• Abstract summary: We present a graph-based deep learning framework for predicting the magnetic properties of quasi-one-dimensional Ising spin systems.<n>The lattice geometry is encoded as a graph and processed by a graph neural network (GNN) followed by fully connected layers.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a graph-based deep learning framework for predicting the magnetic properties of quasi-one-dimensional Ising spin systems. The lattice geometry is encoded as a graph and processed by a graph neural network (GNN) followed by fully connected layers. The model is trained on Monte Carlo simulation data and accurately reproduces key features of the magnetization curve, including plateaus, critical transition points, and the effects of geometric frustration. It captures both local motifs and global symmetries, demonstrating that GNNs can infer magnetic behavior directly from structural connectivity. The proposed approach enables efficient prediction of magnetization without the need for additional Monte Carlo simulations.

Related papers

• A Spectral Interpretation of Redundancy in a Graph Reservoir [51.40366905583043]
  This work revisits the definition of the reservoir in the Multiresolution Reservoir Graph Neural Network (MRGNN)<n>It proposes a variant based on a Fairing algorithm originally introduced in the field of surface design in computer graphics.<n>The core contribution of the paper lies in the theoretical analysis of the algorithm from a random walks perspective.
  arXiv  Detail & Related papers  (2025-07-17T10:02:57Z)
• A Deep Generative Model for the Simulation of Discrete Karst Networks [0.0]
  We use graph generative models to represent karst networks as graphs.<n> nodes retain spatial information and properties, while edges signify connections between nodes.<n>We test our approach using real-world karst networks and compare generated subgraphs with actual subgraphs from the database.
  arXiv  Detail & Related papers  (2025-06-11T15:10:41Z)
• Revealing Decurve Flows for Generalized Graph Propagation [108.80758541147418]
  This study addresses the limitations of the traditional analysis of message-passing, central to graph learning, by defining em textbfgeneralized propagation with directed and weighted graphs. We include a preliminary exploration of learned propagation patterns in datasets, a first in the field.
  arXiv  Detail & Related papers  (2024-02-13T14:13:17Z)
• Convolutional Neural Networks on Manifolds: From Graphs and Back [122.06927400759021]
  We propose a manifold neural network (MNN) composed of a bank of manifold convolutional filters and point-wise nonlinearities. To sum up, we focus on the manifold model as the limit of large graphs and construct MNNs, while we can still bring back graph neural networks by the discretization of MNNs.
  arXiv  Detail & Related papers  (2022-10-01T21:17:39Z)
• Learnable Filters for Geometric Scattering Modules [64.03877398967282]
  We propose a new graph neural network (GNN) module based on relaxations of recently proposed geometric scattering transforms. Our learnable geometric scattering (LEGS) module enables adaptive tuning of the wavelets to encourage band-pass features to emerge in learned representations.
  arXiv  Detail & Related papers  (2022-08-15T22:30:07Z)
• sMGC: A Complex-Valued Graph Convolutional Network via Magnetic Laplacian for Directed Graphs [10.993455818148341]
  We propose magnetic Laplacian that preserves edge directionality by encoding it into complex phase as a deformation of the Laplacian. In addition, we design an Auto-Regressive Moving-Average filter that is capable of learning global features from graphs. We derive complex-valued operations in graph neural network and devise a simplified Magnetic Graph Convolution network, namely sMGC.
  arXiv  Detail & Related papers  (2021-10-14T17:36:44Z)
• Curvature Graph Neural Network [8.477559786537919]
  We introduce discrete graph curvature (the Ricci curvature) to quantify the strength of structural connection of pairwise nodes. We propose Curvature Graph Neural Network (CGNN), which effectively improves the adaptive locality ability of GNNs. The experimental results on synthetic datasets show that CGNN effectively exploits the topology structure information.
  arXiv  Detail & Related papers  (2021-06-30T00:56:03Z)
• MagNet: A Magnetic Neural Network for Directed Graphs [3.5557219875516655]
  MagNet is a spectral GNN for directed graphs based on a complex Hermitian matrix known as the magnetic Laplacian. We show that MagNet's performance exceeds other spectral GNNs on directed graph node classification and link prediction tasks.
  arXiv  Detail & Related papers  (2021-02-22T22:40:57Z)
• Data-Driven Learning of Geometric Scattering Networks [74.3283600072357]
  We propose a new graph neural network (GNN) module based on relaxations of recently proposed geometric scattering transforms. Our learnable geometric scattering (LEGS) module enables adaptive tuning of the wavelets to encourage band-pass features to emerge in learned representations.
  arXiv  Detail & Related papers  (2020-10-06T01:20:27Z)
• Path Integral Based Convolution and Pooling for Graph Neural Networks [12.801534458657592]
  We propose a path integral based graph neural networks (PAN) for classification and regression tasks on graphs. PAN provides a versatile framework that can be tailored for different graph data with varying sizes and structures. Experimental results show that PAN achieves state-of-the-art performance on various graph classification/regression tasks.
  arXiv  Detail & Related papers  (2020-06-29T16:20:33Z)
• Infinitely Wide Graph Convolutional Networks: Semi-supervised Learning via Gaussian Processes [144.6048446370369]
  Graph convolutional neural networks(GCNs) have recently demonstrated promising results on graph-based semi-supervised classification. We propose a GP regression model via GCNs(GPGC) for graph-based semi-supervised learning. We conduct extensive experiments to evaluate GPGC and demonstrate that it outperforms other state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-02-26T10:02:32Z)

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.