mlsanityData to 14 Oct 2026

Fast Simulation of Particulate Suspensions Enabled by Graph Neural Network

arXiv 2206.13905 ↗First posted 17 Jun 2022cs.LG physics.flu-dyncited by 5

Not on the map. Why?

Abstract (arXiv)

Predicting the dynamic behaviors of particles in suspension subject to hydrodynamic interaction (HI) and external drive can be critical for many applications. By harvesting advanced deep learning techniques, the present work introduces a new framework, hydrodynamic interaction graph neural network (HIGNN), for inferring and predicting the particles' dynamics in Stokes suspensions. It overcomes the limitations of traditional approaches in computational efficiency, accuracy, and/or transferability. In particular, by uniting the data structure represented by a graph and the neural networks with learnable parameters, the HIGNN constructs surrogate modeling for the mobility tensor of particles which is the key to predicting the dynamics of particles subject to HI and external forces. To account for the many-body nature of HI, we generalize the state-of-the-art GNN by introducing higher-order connectivity into the graph and the corresponding convolutional operation. For training the HIGNN, we only need the data for a small number of particles in the domain of interest, and hence the training cost can be maintained low. Once constructed, the HIGNN permits fast predictions of the particles' velocities and is transferable to suspensions of different numbers/concentrations of particles in the same domain and to any external forcing. It has the ability to accurately capture both the long-range HI and short-range lubrication effects. We demonstrate the accuracy, efficiency, and transferability of the proposed HIGNN framework in a variety of systems. The requirement on computing resource is minimum: most simulations only require a desktop with one GPU; the simulations for a large suspension of 100,000 particles call for up to 6 GPUs.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 9 of its 53 references that are in the map. First posted on arXiv 17 Jun 2022.

Builds on

9 of 53 references.

References · 9

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  3. 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,223
  4. 2018Relational inductive biases, deep learning, and graph networkscited by 1,360
  5. 2020Learning to Simulate Complex Physics with Graph Networkscited by 880
  6. 2015Automatic differentiation in machine learning: a surveycited by 855
  7. 2016Interaction Networks for Learning about Objects, Relations and Physicscited by 509
  8. 2018Propagation Networks for Model-Based Control Under Partial Observationcited by 64
  9. 2019A scalable computational platform for particulate Stokes suspensionscited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 1.

5 papers.