Searcharxiv⌕ Search

arXiv · 2611.18081

Generalized hydraulic neural operators turbocharging sewer digital twins

Abstract

Hydraulic digital twins are emerging as the next-generation paradigm for operating and managing sewer systems. Conventional hydraulic digital twinning relies on running physics-based models (e.g., Saint-Venant equations), which are computationally expensive and often too slow for real-time applications. Although surrogates (e.g., neural networks) can be fast, existing approaches are typically non-generalizable, requiring costly retraining for unseen pipes, networks, or flow conditions. Here, we develop a fast, generalized and differentiable multi-branch neural operator trained on solutions of the Saint-Venant equations that predicts in-pipe hydraulics. The learned operator reproduces complex hydraulic dynamics with high fidelity while achieving thousand- to million-fold speedups for online prediction, data assimilation, and diagnostics. Equally importantly, the learned operator generalizes to unseen pipes, networks, and flow conditions without retraining. These advances address key computational barriers to real-time sewer digital twins, opening new opportunities for more responsive flood-risk management and protection of urban water environments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruozhou Lin, Shixun Li, Tao Shi, Lihan Hu, Zhiyu Zhang, Wenchong Tian, Zhiguo Yuan. 2026-11-13. Generalized hydraulic neural operators turbocharging sewer digital twins. https://searcharxiv.com/abs/2611.18081

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↗