Learning Kinetic Monte Carlo stochastic dynamics with Deep Generative Adversarial Networks

Daniele Lanzoni, Olivier Pierre-Louis, Roberto Bergamaschini, Francesco Montalenti
7/29/2025
cond-mat.stat-mechcond-mat.mtrl-scics.AI

No confident code implementation found for this paper. 6 possible matches can be shown below.

Abstract

We show that Generative Adversarial Networks (GANs) may be fruitfully exploited to learn stochastic dynamics, surrogating traditional models while capturing thermal fluctuations. Specifically, we showcase the application to a two-dimensional, many-particle system, focusing on surface-step fluctuations and on the related time-dependent roughness. After the construction of a dataset based on Kinetic Monte Carlo simulations, a conditional GAN is trained to propagate stochastically the state of the system in time, allowing the generation of new sequences with a reduced computational cost. Modifications with respect to standard GANs, which facilitate convergence and increase accuracy, are discussed. The trained network is demonstrated to quantitatively reproduce equilibrium and kinetic properties, including scaling laws, with deviations of a few percent from the exact value. Extrapolation limits and future perspectives are critically discussed.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 6 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lanzoni2025learning,
  title  = {Learning Kinetic Monte Carlo stochastic dynamics with Deep Generative Adversarial Networks},
  author = {Daniele Lanzoni and Olivier Pierre-Louis and Roberto Bergamaschini and Francesco Montalenti},
  year   = {2025},
  eprint = {2507.21763},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.21763v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.21763.svg)](https://codeofpaper.com/paper/2507.21763)

Discussion