Methods › General › Mesh-Based Simulation Models › MeshGraphNet

MeshGraphNet

5 papers tagged archive 2025-07-28

Introduced by Tobias Pfaff et al. in Learning Mesh-Based Simulation with Graph Networks

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

MeshGraphNet is a framework for learning mesh-based simulations using graph neural networks. The model can be trained to pass messages on a mesh graph and to adapt the mesh discretization during forward simulation. The model uses an Encode-Process-Decode architecture trained with one-step supervision, and can be applied iteratively to generate long trajectories at inference time. The encoder transforms the input mesh Mᵗ into a graph, adding extra world-space edges. The processor performs several rounds of message passing along mesh edges and world edges, updating all node and edge embeddings. The decoder extracts the acceleration for each node, which is used to update the mesh to produce Mᵗ⁺¹.

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: MeshGraphNet-Transformer (MGN-T); Long-Short-Edge MeshGraphNet (LSE-MGN).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 5 · with a code link: 2 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 5 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 5 of 5, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

3 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Computational Efficiency1
Graph Neural Network1
Numerical Integration1

Usage over time archive 2025-07-28

Papers per year tagged with MeshGraphNet: 2020 to 2025, peak 2 2 0 2020: 1 paper 2020 2021: 0 papers 2021 2022: 0 papers 2022 2023: 1 paper 2023 2024: 2 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (5 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Mesh-Based Simulation ModelsGraph Models

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