Learning Distributions of Complex Fluid Simulations with Diffusion Graph Networks
Mario Lino, Tobias Pfaff, Nils Thuerey
TL;DR
This work tackles the challenge of obtaining full statistical distributions of unsteady fluid states without long simulations. It introduces diffusion on graphs (DGN) and a latent-space variant (LDGN) to sample converged flow states conditioned on mesh geometry and physical parameters, with a multi-scale GNN processor and a VGAE latent space to improve efficiency and reduce high-frequency artifacts. The methods are validated on Ellipse, EllipseFlow, and Wing domains, showing that LDGN more accurately captures distributions and generalizes across parameter settings while delivering substantial speedups over conventional CFD runs. The approach enables efficient computation of flow statistics (e.g., RMS, two-point correlations) and holds promise for complex, large-scale applications where direct CFD is prohibitive. Future directions include incorporating temporal conditioning and flow matching to further enhance temporal correlations and sampling speed.
Abstract
Physical systems with complex unsteady dynamics, such as fluid flows, are often poorly represented by a single mean solution. For many practical applications, it is crucial to access the full distribution of possible states, from which relevant statistics (e.g., RMS and two-point correlations) can be derived. Here, we propose a graph-based latent diffusion (or alternatively, flow-matching) model that enables direct sampling of states from their equilibrium distribution, given a mesh discretization of the system and its physical parameters. This allows for the efficient computation of flow statistics without running long and expensive numerical simulations. The graph-based structure enables operations on unstructured meshes, which is critical for representing complex geometries with spatially localized high gradients, while latent-space diffusion modeling with a multi-scale GNN allows for efficient learning and inference of entire distributions of solutions. A key finding is that the proposed networks can accurately learn full distributions even when trained on incomplete data from relatively short simulations. We apply this method to a range of fluid dynamics tasks, such as predicting pressure distributions on 3D wing models in turbulent flow, demonstrating both accuracy and computational efficiency in challenging scenarios. The ability to directly sample accurate solutions, and capturing their diversity from short ground-truth simulations, is highly promising for complex scientific modeling tasks.
