mlsanityData to 13 Oct 2026

Reconstructing nodal pressures in water distribution systems with graph neural networks

arXiv 2104.13619 ↗First posted 28 Apr 2021cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Knowing the pressure at all times in each node of a water distribution system (WDS) facilitates safe and efficient operation. Yet, complete measurement data cannot be collected due to the limited number of instruments in a real-life WDS. The data-driven methodology of reconstructing all the nodal pressures by observing only a limited number of nodes is presented in the paper. The reconstruction method is based on K-localized spectral graph filters, wherewith graph convolution on water networks is possible. The effect of the number of layers, layer depth and the degree of the Chebyshev-polynomial applied in the kernel is discussed taking into account the peculiarities of the application. In addition, a weighting method is shown, wherewith information on friction loss can be embed into the spectral graph filters through the adjacency matrix. The performance of the proposed model is presented on 3 WDSs at different number of nodes observed compared to the total number of nodes. The weighted connections prove no benefit over the binary connections, but the proposed model reconstructs the nodal pressure with at most 5% relative error on average at an observation ratio of 5% at least. The results are achieved with shallow graph neural networks by following the considerations discussed in the paper.

Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). Builds on 13 of its 57 references that are in the map. First posted on arXiv 28 Apr 2021.

Builds on

13 of 57 references.

References · 13

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,093
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,223
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,318
  4. 2016Gaussian Error Linear Units (GELUs)cited by 3,472
  5. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,911
  6. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,472
  7. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,422
  8. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,086
  9. 2019Simplifying Graph Convolutional Networkscited by 1,474
  10. 2016Kernel-based Reconstruction of Graph Signalscited by 20
  11. 2020Deep Reinforcement Learning for Real-Time Optimization of Pumps in Water Distribution Systemscited by 5
  12. 2020Learning Optimal Control of Water Distribution Networks through Sequential Model-based Optimizationcited by 2
1 more
  1. 2020Sensor selection on graphs via data-driven node sub-sampling in network time seriescited by 2

Built on by

Cited by year

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

6 papers.