Papers › Learning Mesh-Based Simulation with Graph Networks

Learning Mesh-Based Simulation with Graph Networks

7 Oct 2020ICLR 2021 1arXiv:2010.03409archive 2025-07-28

Tobias Pfaff, Meire Fortunato, Alvaro Sanchez-Gonzalez, Peter W. Battaglia

Mesh-based simulations are central to modeling complex physical systems in many disciplines across science and engineering. Mesh representations support powerful numerical integration methods and their resolution can be adapted to strike favorable trade-offs between accuracy and efficiency. However, high-dimensional scientific simulations are very expensive to run, and solvers and parameters must often be tuned individually to each system studied. Here we introduce MeshGraphNets, a framework for learning mesh-based simulations using graph neural networks. Our model can be trained to pass messages on a mesh graph and to adapt the mesh discretization during forward simulation. Our results show it can accurately predict the dynamics of a wide range of physical systems, including aerodynamics, structural mechanics, and cloth. The model's adaptivity supports learning resolution-independent dynamics and can scale to more complex state spaces at test time. Our method is also highly efficient, running 1-2 orders of magnitude faster than the simulation on which it is trained. Our approach broadens the range of problems on which neural network simulators can operate and promises to improve the efficiency of complex, scientific modeling tasks.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

No sample from the archive's official repository (deepmind/deepmind-research) is linked to this paper; the 4 samples below come from 2 community repositories. Syntology harvested code from deepmind/deepmind-research for 4 other papers.

deepmind/deepmind-research: Syntology's graph links these samples to Disentangling by Subspace Diffusion (arXiv:2006.12982; that paper's own run record: 6 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified), Characterizing signal propagation to close the performance gap in unnormalized ResNets (arXiv:2101.08692; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified), Perceiver: General Perception with Iterative Attention (arXiv:2103.03206; that paper's own run record: 41 ran (of which 20 constructed an object rather than computing a result; 30 with no instrument failure: 0 honoured, 2 violated, 28 with no contract checked; 11 where Syntology's instrument failed) · 14 unverified) and 1 more (every one in this page's JSON twin); nothing checks that they implement this paper's method.

Syntology 4 code samples harvested from 2 repositories linked to this paper: 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: community (archive-listed): 4 samples from 2 repositories, 4 ran (2 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 4 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

deepmind/deepmind-research officialmentioned in papertfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Disentangling by Subspace Diffusion (arXiv:2006.12982; that paper's own run record: 6 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified), Characterizing signal propagation to close the performance gap in unnormalized ResNets (arXiv:2101.08692; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified), Perceiver: General Perception with Iterative Attention (arXiv:2103.03206; that paper's own run record: 41 ran (of which 20 constructed an object rather than computing a result; 30 with no instrument failure: 0 honoured, 2 violated, 28 with no contract checked; 11 where Syntology's instrument failed) · 14 unverified) and 1 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report
CCSI-Toolset/MGN mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (1 instrument-failed) · 0 unverified report
DonsetPG/graph-physics mentioned on GitHubjaxSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Multi-Grid Graph Neural Networks with Self-Attention for Computational Mechanics (arXiv:2409.11899; that paper's own run record: 8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified); nothing checks that they implement this paper's method. report
amaleki2/graph_networks mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Relational inductive biases, deep learning, and graph networks (arXiv:1806.01261; that paper's own run record: 39 ran (of which 5 constructed an object rather than computing a result; 38 with no instrument failure: 4 honoured, 0 violated, 34 with no contract checked; 1 where Syntology's instrument failed) · 12 unverified); nothing checks that they implement this paper's method. report
echowve/meshGraphNets_pytorch mentioned on GitHubpytorchSyntology: 3 samples, 3 ran (1 instrument-failed) · 0 unverified report
geoelements/gns mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Learning to Simulate Complex Physics with Graph Networks (arXiv:2002.09405; that paper's own run record: 17 ran (of which 5 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 1 violated, 15 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified); nothing checks that they implement this paper's method. report
idoby/paper-summaries mentioned on GitHubSyntology: not harvested report
jlinki/ggns mentioned on GitHubpytorchSyntology: not harvested report
wwMark/meshgraphnets mentioned on GitHubpytorchSyntology: not harvested report
2023-MindSpore-4/Code-5 mindsporeSyntology: not harvested report
Litianyu141/FVGN-sub-Meshgraphnet tfSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

4 samples harvested: 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran · honoured contract
2ran · our draft was wrong

Licence: 1 of the 4 samples is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

CCSI-Toolset/MGN community (archive-listed) 1 sample, 1 ran (1 instrument-failed) · 0 unverified
tableau_builder GNN/MeshGraphNets.py ran · our draft was wrong licence not identified · pointer only · 34453417d3c1864e · report fixture: signature method:str/0/str · returned tuple · level recorded 2026-09-22
echowve/meshGraphNets_pytorch community (archive-listed) 3 samples, 3 ran (1 instrument-failed) · 0 unverified
fig2data in 10 papers render_results.py ran · honoured contract Apache-2.0 (permissive) · e7e2742326c28429 · report fixture: signature fig:Figure/0/? · returned ndarray · level recorded 2026-09-22
render in 19 papers render_results.py ran · our draft was wrong Apache-2.0 (permissive) · 1238daf814ff116d · report fixture: signature args:tuple/1/int · returned tuple · level recorded 2026-09-22
rollout_error rollout.py ran · honoured contract fingerprinted Apache-2.0 (permissive) · 6ec74c26926c8475 · report fixture: signature predicteds:ndarray/2/float, targets:ndarray/2/float · returned ndarray · level recorded 2026-09-22

Tasks

Numerical Integration

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: MeshGraphNet

MeshGraphNet

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections