Skip to content
AI News HubLIVE
Original source2 min read

TRACE: Spatiotemporal Contact Memory Graph Network Simulator for Granular Dynamics

Summary

TRACE is a graph-network simulator that stores inter-granular contact history directly on edges, using persistent edge memory, attention-based message passing, and an edge-identity dictionary to handle changing contact topologies. It outperforms existing graph simulators on 2D and 3D granular column-collapse benchmarks while running dramatically faster than the material point method.

SourcearXiv Machine LearningAuthor: Changjian Zhou, Negin Yousefpour, Jie Qi, Junfeng Fang, Guillermo A. Narsilio, Hans Petter Jostad
TRACE: Spatiotemporal Contact Memory Graph Network Simulator for Granular Dynamics
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 2 Sep 2026]

Title:TRACE: Spatiotemporal Contact Memory Graph Network Simulator for Granular Dynamics

View a PDF of the paper titled TRACE: Spatiotemporal Contact Memory Graph Network Simulator for Granular Dynamics, by Changjian Zhou and 5 other authors

View PDF HTML (experimental)

Abstract:Learned graph simulators provide an efficient alternative to high-fidelity solvers for granular dynamics. However, granular motion depends strongly on inter-granular contact history, which is difficult to preserve when particle contacts form, break, and rearrange. Existing simulators mainly store temporal information in node features or node-level memory. Here we introduce TRACE, a graph-network simulator that stores interaction history directly on contact edges. Each edge maintains a persistent memory updated by attention-based message passing and a gated recurrent unit, while an edge-identity dictionary preserves this memory as the contact graph changes. A physics-structured decoder predicts inter-granular normal and tangential contact forces, enforces the Coulomb friction limit, and applies equal-and-opposite internal forces. The model is trained with single-step pretraining followed by autoregressive rollout fine-tuning. We evaluate TRACE on 2D and 3D granular column-collapse benchmarks. In both cases, TRACE produces stable, physically consistent long-horizon rollouts, closely reproducing the final deposit geometry and the kinetic energy released during collapse. Compared with graph network simulator (GNS) and node-memory graph neural simulator (NMGNS), TRACE reduces long-rollout position error by 31-62% and final-deposit error by 58-89% across the two benchmarks, while using fewer parameters and maintaining near-zero particle interpenetration. TRACE also achieves 12.2$\times$ and 8.9$\times$ speedups over the material point method (MPM) reference solver in 2D and 3D, respectively. Our code is available at this https URL.

Subjects:

Machine Learning (cs.LG); Numerical Analysis (math.NA); Machine Learning (stat.ML)

Cite as: arXiv:2609.02991 [cs.LG]

(or arXiv:2609.02991v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2609.02991

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Changjian Zhou [view email] [v1] Wed, 2 Sep 2026 15:30:41 UTC (23,476 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled TRACE: Spatiotemporal Contact Memory Graph Network Simulator for Granular Dynamics, by Changjian Zhou and 5 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.LG

new | recent | 2026-09

Change to browse by:

cs cs.NA math math.NA stat stat.ML

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Stores interaction history on edges rather than node features or node-level memory.
  • Reduces long-rollout position error by 31–62% and final-deposit error by 58–89% versus GNS and NMGNS.
  • Achieves 12.2x and 8.9x speedups over the material point method in 2D and 3D, with fewer parameters and near-zero particle interpenetration.

Highlights and analysis are generated automatically and may contain errors. Check the original source.