Adaptive Graph Rewiring to Mitigate Over-Squashing in Mesh-Based GNNs for Fluid Dynamics Simulations

• URL: http://arxiv.org/abs/2511.12709v1
• Date: Sun, 16 Nov 2025 17:51:37 GMT
• Title: Adaptive Graph Rewiring to Mitigate Over-Squashing in Mesh-Based GNNs for Fluid Dynamics Simulations
• Authors: Sangwoo Seo, Hyunsung Kim, Jiwan Kim, Chanyoung Park,
• Abstract summary: Mesh-based simulation using Graph Neural Networks (GNNs) has been recognized as a promising approach for modeling fluid dynamics.<n>We propose a novel framework, called Adaptive Graph Rewiring in Mesh-Based Graph Neural Networks (AdaMeshNet), that introduces an adaptive rewiring process into the message-passing procedure.<n>Our method computes a rewiring delay score for bottleneck nodes in the mesh graph, based on the shortest-path distance and the velocity difference.
• Score: 16.679879462679857
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Mesh-based simulation using Graph Neural Networks (GNNs) has been recognized as a promising approach for modeling fluid dynamics. However, the mesh refinement techniques which allocate finer resolution to regions with steep gradients can induce the over-squashing problem in mesh-based GNNs, which prevents the capture of long-range physical interactions. Conventional graph rewiring methods attempt to alleviate this issue by adding new edges, but they typically complete all rewiring operations before applying them to the GNN. These approaches are physically unrealistic, as they assume instantaneous interactions between distant nodes and disregard the distance information between particles. To address these limitations, we propose a novel framework, called Adaptive Graph Rewiring in Mesh-Based Graph Neural Networks (AdaMeshNet), that introduces an adaptive rewiring process into the message-passing procedure to model the gradual propagation of physical interactions. Our method computes a rewiring delay score for bottleneck nodes in the mesh graph, based on the shortest-path distance and the velocity difference. Using this score, it dynamically selects the message-passing layer at which new edges are rewired, which can lead to adaptive rewiring in a mesh graph. Extensive experiments on mesh-based fluid simulations demonstrate that AdaMeshNet outperforms conventional rewiring methods, effectively modeling the sequential nature of physical interactions and enabling more accurate predictions.

Related papers

• Graph Signal Generative Diffusion Models [74.75869068073577]
  We introduce U-shaped encoder-decoder graph neural networks (U-GNNs) for graph signal generation using denoising diffusion processes.<n>The architecture learns node features at different resolutions with skip connections between the encoder and decoder paths.<n>We demonstrate the effectiveness of the diffusion model in probabilistic forecasting of stock prices.
  arXiv  Detail & Related papers  (2025-09-21T21:57:27Z)
• PIORF: Physics-Informed Ollivier-Ricci Flow for Long-Range Interactions in Mesh Graph Neural Networks [23.97389618896843]
  We propose Physics-Informed Ollivier-Ricci Flow (PIORF), a novel rewiring method that combines physical correlations with graph topology.<n>We show that PIORF consistently outperforms baseline models and existing rewiring methods, achieving up to 26.2 improvement.
  arXiv  Detail & Related papers  (2025-04-05T04:14:05Z)
• Point Cloud Denoising With Fine-Granularity Dynamic Graph Convolutional Networks [58.050130177241186]
  Noise perturbations often corrupt 3-D point clouds, hindering downstream tasks such as surface reconstruction, rendering, and further processing. This paper introduces finegranularity dynamic graph convolutional networks called GDGCN, a novel approach to denoising in 3-D point clouds.
  arXiv  Detail & Related papers  (2024-11-21T14:19:32Z)
• Gradient Rewiring for Editable Graph Neural Network Training [84.77778876113099]
  underlineGradient underlineRewiring method for underlineEditable graph neural network training, named textbfGRE. We propose a simple yet effective underlineGradient underlineRewiring method for underlineEditable graph neural network training, named textbfGRE.
  arXiv  Detail & Related papers  (2024-10-21T01:01:50Z)
• Enhancing Graph U-Nets for Mesh-Agnostic Spatio-Temporal Flow Prediction [2.3964255330849356]
  We explore the potential of Graph U-Nets for unsteady flow-field prediction. We propose novel approaches to improve mesh-agnostic-temporal robustness prediction transient flow fields using Graph U-Nets. Key enhancements to the Graph U-Net architecture provide increased flexibility in modeling node dynamics.
  arXiv  Detail & Related papers  (2024-06-06T07:01:36Z)
• Identification of vortex in unstructured mesh with graph neural networks [0.0]
  We present a Graph Neural Network (GNN) based model with U-Net architecture to identify the vortex in CFD results on unstructured meshes. A vortex auto-labeling method is proposed to label vortex regions in 2D CFD meshes.
  arXiv  Detail & Related papers  (2023-11-11T12:10:16Z)
• A Finite Element-Inspired Hypergraph Neural Network: Application to Fluid Dynamics Simulations [4.984601297028257]
  An emerging trend in deep learning research focuses on the applications of graph neural networks (GNNs) for continuum mechanics simulations. We present a method to construct a hypergraph by connecting the nodes by elements rather than edges. We term this method a finite element-inspired hypergraph neural network, in short FEIH($phi$)-GNN.
  arXiv  Detail & Related papers  (2022-12-30T04:10:01Z)
• MultiScale MeshGraphNets [65.26373813797409]
  We propose two complementary approaches to improve the framework from MeshGraphNets. First, we demonstrate that it is possible to learn accurate surrogate dynamics of a high-resolution system on a much coarser mesh. Second, we introduce a hierarchical approach (MultiScale MeshGraphNets) which passes messages on two different resolutions.
  arXiv  Detail & Related papers  (2022-10-02T20:16:20Z)
• Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
  Modelling long-range dependencies is critical for scene understanding tasks in computer vision. A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
  arXiv  Detail & Related papers  (2022-09-20T14:41:37Z)
• M2N: Mesh Movement Networks for PDE Solvers [17.35053721712421]
  We present the first learning-based end-to-end mesh movement framework for PDE solvers. Key requirements are alleviating mesh, boundary consistency, and generalization to mesh with different resolutions. We validate our methods on stationary and time-dependent, linear and non-linear equations.
  arXiv  Detail & Related papers  (2022-04-24T04:23:31Z)
• Combining Differentiable PDE Solvers and Graph Neural Networks for Fluid Flow Prediction [79.81193813215872]
  We develop a hybrid (graph) neural network that combines a traditional graph convolutional network with an embedded differentiable fluid dynamics simulator inside the network itself. We show that we can both generalize well to new situations and benefit from the substantial speedup of neural network CFD predictions.
  arXiv  Detail & Related papers  (2020-07-08T21:23:19Z)

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.