arXiv Machine Learning By Karn Tiwari, Niladri Dutta, N M Anoop Krishnan, Prathosh A P

Graph Mamba Operator: A Latent Simulator for Interacting Particle Systems

Read the original on arXiv Machine Learning →

arXiv:2606. 09432v1 Announce Type: new Abstract: Modeling interacting dynamical systems requires capturing spatial interactions alongside long-range temporal dependencies.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Sep 25

Beyond Static Graph World Models: Learning Stochastic Latent Dynamics over Evolving Topologies

The paper introduces the Graph Dynamics Model (GDM), a world model that learns stochastic latent dynamics over evolving graph topologies. GDM employs a sparse recurrent adjacency matrix for topology updates and a recurrent state‑space architecture for stochastic transitions, enabling it to handle partially observable, stochastic environments. The authors also propose the Graph Distribution Distance (GDD) metric, using maximum mean discrepancy with a graph kernel, to compare predicted and true joint graph state distributions, and demonstrate GDM’s superior performance and zero‑shot generalisation on large graphs.

By Alex Schutz, Nick Hawes, Victor-Alexandru Darvariu
arXiv Machine Learning
5d ago

Adaptive Interaction Graphs for Particle Simulation

The paper introduces AdaptGNS, a particle simulation framework that dynamically adjusts the interaction graph based on per-particle uncertainty estimates. By training a variance head jointly with the acceleration head using a heteroscedastic Gaussian NLL loss, the model expands the neighborhood of high‑uncertainty particles, improving long‑horizon accuracy. Experiments show a strict Pareto improvement on the WaterDrop benchmark and a modest gain on Sand, suggesting adaptive graphs are especially beneficial in spatially complex regions.

By Aiden Zhou