Searcharxiv⌕ Search

arXiv · 2611.17156

A hierarchical graph neural network for efficient particle-resolved prediction of granular flow dynamics

Abstract

Graph neural surrogates for granular flow can resolve the motion of individual grains, but propagating information across a large amount of grains requires repeated, costly updates on the full particle graph. This study introduce a Hierarchical Coarse-Grained Graph Neural Network (HCG-GNN) that couples direct interactions between neighboring grains with information exchange on two coarser graphs of occupied spatial cells. In discrete element method (DEM) benchmarks of granular flows down incline planes, HCG-GNN captured key flow characteristics, including front propagation, lateral spreading, deposition morphology, free surface evolution, internal shear behavior, and energy conversion. Results also show that preserving grain-specific features as coarse information returned to the particle graph and integrating predicted accelerations to advance particle motion both improved multi-step accuracy. With 5 of its 7 message-passing steps performed on coarse graphs, HCG-GNN achieved accuracy comparable to a conventional particle-level GNN with a 6.47-fold training speedup and 46.2% lower GPU memory use. A model trained on up to 5000 grains predicted a 2 s release of 10000 grains in 31 s, compared with 2000 s for DEM under the benchmark conditions. This combination of speed and grain-scale resolution supports particle-resolved inverse design, with prescribed runout or discharge targets guiding the search for suitable geometries and grain dynamics revealing the basis for differences in performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kuang Shi, Qingqi Zhao, Teng Man, Sergio Andres Galindo-Torres, Yimin Lu. 2026-11-12. A hierarchical graph neural network for efficient particle-resolved prediction of granular flow dynamics. https://searcharxiv.com/abs/2611.17156

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Adaptive Finite State Projection with Quantile-Based Pruning for Solving the Chemical Master Equation

We present an adaptive Finite State Projection (FSP) method for efficiently solving the Chemical Master Equation (CME) with rigorous error control. Our approach integrates time-stepping with dynamic state-space truncation, balancing accuracy and computational cost. Krylov subspace methods approximate the matrix exponential, while quantile-based pruning controls state-space growth by removing low-probability states. Theoretical error bounds ensure that the truncation error remains bounded by the pruned mass at each step, which is user-controlled, and does not propagate forward in time. Numerical experiments on biochemical systems, including the Lotka-Volterra and Michaelis-Menten and bi-stable toggle switch models.

cs.CE↗

SoK: Market Microstructure for Decentralized Prediction Markets (DePMs)

Decentralized prediction markets (DePMs) allow open participation in event-based wagering without fully relying on centralized intermediaries. We review the history of DePMs which date back to 2011 and includes hundreds of proposals. Perhaps surprising, modern DePMs like Polymarket deviate materially from earlier designs like Truthcoin and Augur v1. We use our review to present a modular workflow comprising eight stages: underlying infrastructure, market topic, share structure and pricing, market initialization, trading, market resolution, settlement, and archiving. For each module, we enumerate the design variants, analyzing trade-offs around decentralization, expressiveness, and manipulation resistance. We also identify open problems for researchers interested in this ecosystem.

cs.CE↗

A Multigrid Finite State Projection Algorithm For The Solution Of The Reaction-Diffusion Master Equation

We develop a multigrid method for the finite state projection of the reaction-diffusion master equation (RDME). The RDME evolves the joint probabilities of molecular count configurations across well-mixed voxels coupled by local reactions and diffusive jumps. When fast diffusion or large reaction rates make this evolution stiff over long time horizons, implicit time stepping requires solving a large shifted linear system at every step. Grouping neighboring voxels and summing their molecular counts produces a hierarchy of coarser state spaces terminating at a one-voxel chemical master equation. Restriction sums residual entries with the same coarse counts, while multinomial prolongation preserves the RDME generator form on every level with explicit coarse reaction and diffusion rates. For reversible diffusion, the error omitted by coarsening is bounded by the graph Dirichlet energy of jumps inside the aggregates, with a constant independent of population. Numerical tests with standard multigrid cycles and point or block Gauss-Seidel smoothing reach 7.16 million states and resolve rare probabilities of order $10^{-7}$.

cs.CE↗