Modeling subgrid scale production rates on complex meshes using graph neural networks

• URL: http://arxiv.org/abs/2603.19841v1
• Date: Fri, 20 Mar 2026 10:35:46 GMT
• Title: Modeling subgrid scale production rates on complex meshes using graph neural networks
• Abstract summary: We develop a graph neural network (GNN) that predicts filtered species production rates on non-uniform meshes.<n>Direct numerical simulations of turbulent premixed hydrogen-methane jet flames with hydrogen fractions of 10%, 50%, and 80% provide the dataset.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Large-eddy simulations (LES) require closures for filtered production rates because the resolved fields do not contain all correlations that govern chemical source terms. We develop a graph neural network (GNN) that predicts filtered species production rates on non-uniform meshes from inputs of filtered mass fractions and temperature. Direct numerical simulations of turbulent premixed hydrogen-methane jet flames with hydrogen fractions of 10%, 50%, and 80% provide the dataset. All fields are Favre filtered with the filter width matched to the operating mesh, and learning is performed on subdomain graphs constructed from mesh-point connectivity. A compact set of reactants, intermediates, and products is used, and their filtered production rates form the targets. The model is trained on 10% and 80% blends and evaluated on the unseen 50% blend to test cross-composition generalization. The GNN is compared against an unclosed reference that evaluates rates at the filtered state, and a convolutional neural network baseline that requires remeshing. Across in-distribution and out-of-distribution cases, the GNN yields lower errors and closer statistical agreement with the reference data. Furthermore, the model demonstrates robust generalization across varying filter widths without retraining, maintaining bounded errors at coarser spatial resolutions. A backward facing step configuration further confirms prediction efficacy on a practically relevant geometry. These results highlight the capability of GNNs as robust data-driven closure models for LES on complex meshes.

Related papers

• Fluid-DiT: Graph-Free Diffusion Transformers for Fluid Flow Simulations Learning [50.053186229257555]
  We propose a Graph-Free Diffusion Transformer that replaces graph message passing with attention-based denoising.<n>By leveraging the transformer's global receptive field, Fluid-DiT naturally captures both local flow structures and long-range correlations.<n>It consistently outperforms graph-based diffusion baselines in both sample quality and distributional accuracy.
  arXiv  Detail & Related papers  (2026-08-07T12:28:45Z)
• Generative Diffusion Models of Stochastic Graph Signals [74.4097723209053]
  This paper tackles problems of conditional graph signal generative modeling and tackles them with a single denoising diffusion framework.<n>We learn a reverse diffusion process, parametrized by graph neural networks (GNNs), that draws graph signals conditioned directly on the graph topology and on node-feature side information.<n>We demonstrate our method on two generative tasks: stock price forecasting and optimal wireless resource allocation, with extensive numerical results in both domains.
  arXiv  Detail & Related papers  (2026-07-07T22:02:13Z)
• Extra Clients at No Extra Cost: Overcome Data Heterogeneity in Federated Learning with Filter Decomposition [25.658632928800962]
  We propose a technique for decomposing a convolutional filter in federated learning (FL) into a linear combination of filter subspace elements.<n>This simple technique transforms global filter aggregation in FL into aggregating filter atoms and their atom coefficients.<n> Empirical results on benchmark datasets demonstrate that our filter decomposition technique substantially improves the accuracy of FL methods.
  arXiv  Detail & Related papers  (2025-03-11T17:42:36Z)
• Mesh-based Super-Resolution of Fluid Flows with Multiscale Graph Neural Networks [0.0]
  A graph neural network (GNN) approach is introduced in this work which enables mesh-based three-dimensional super-resolution of fluid flows.<n>In this framework, the GNN is designed to operate not on the full mesh-based field at once, but on localized meshes of elements (or cells) directly.
  arXiv  Detail & Related papers  (2024-09-12T05:52:19Z)
• Generalization of Graph Neural Networks is Robust to Model Mismatch [84.01980526069075]
  Graph neural networks (GNNs) have demonstrated their effectiveness in various tasks supported by their generalization capabilities. In this paper, we examine GNNs that operate on geometric graphs generated from manifold models. Our analysis reveals the robustness of the GNN generalization in the presence of such model mismatch.
  arXiv  Detail & Related papers  (2024-08-25T16:00:44Z)
• Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler [103.97487121678276]
  Filter pruning simultaneously accelerates the computation and reduces the memory overhead of CNNs. We propose a novel Knowledge-driven Differential Filter Sampler(KDFS) with Masked Filter Modeling(MFM) framework for filter pruning.
  arXiv  Detail & Related papers  (2023-07-01T02:28:41Z)
• Geometric Graph Filters and Neural Networks: Limit Properties and Discriminability Trade-offs [122.06927400759021]
  We study the relationship between a graph neural network (GNN) and a manifold neural network (MNN) when the graph is constructed from a set of points sampled from the manifold. We prove non-asymptotic error bounds showing that convolutional filters and neural networks on these graphs converge to convolutional filters and neural networks on the continuous manifold.
  arXiv  Detail & Related papers  (2023-05-29T08:27:17Z)
• SS-GNN: A Simple-Structured Graph Neural Network for Affinity Prediction [8.508602451200352]
  We propose a simple-structured graph neural network (GNN) model named SS-GNN to accurately predict drug-target binding affinity (DTBA) By constructing a single undirected graph based on a distance threshold to represent protein-ligand interactions, the scale of the graph data is greatly reduced. For a typical protein-ligand complex, affinity prediction takes only 0.2 ms.
  arXiv  Detail & Related papers  (2022-05-25T04:47:13Z)
• On the Effective Number of Linear Regions in Shallow Univariate ReLU Networks: Convergence Guarantees and Implicit Bias [50.84569563188485]
  We show that gradient flow converges in direction when labels are determined by the sign of a target network with $r$ neurons. Our result may already hold for mild over- parameterization, where the width is $tildemathcalO(r)$ and independent of the sample size.
  arXiv  Detail & Related papers  (2022-05-18T16:57:10Z)
• Graph Convolutional Neural Networks for Body Force Prediction [0.0]
  A graph based data-driven model is presented to perform inference on fields defined on an unstructured mesh. The network can infer from field samples at different resolutions, and is invariant to the order in which the measurements within each sample are presented.
  arXiv  Detail & Related papers  (2020-12-03T19:53:47Z)
• A machine learning framework for LES closure terms [0.0]
  We derive a consistent framework for LES closure models, with special emphasis laid upon the incorporation of implicit discretization-based filters and numerical approximation errors. We compute the exact closure terms for the different LES filter functions from direct numerical simulation results of decaying homogeneous isotropic turbulence. For the given application, the GRU architecture clearly outperforms the networks in terms of accuracy.
  arXiv  Detail & Related papers  (2020-10-01T08:42:37Z)

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.