Factor Graph Optimization for Leak Localization in Water Distribution Networks
- URL: http://arxiv.org/abs/2509.10982v1
- Date: Sat, 13 Sep 2025 21:06:27 GMT
- Title: Factor Graph Optimization for Leak Localization in Water Distribution Networks
- Authors: Paul Irofti, Luis Romero-Ben, Florin Stoican, Vicenç Puig,
- Abstract summary: This paper is the first to explore the use of factor graph optimization techniques for leak localization in water distribution networks.<n>A new architecture composed of two factor graphs: a leak-free state estimation factor graph and a leak localization factor graph.<n>Results on Modena, L-TOWN and synthetic networks show that factor graphs are much faster than nonlinear Kalman-based alternatives such as the UKF.
- Score: 3.7373312968044643
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Detecting and localizing leaks in water distribution network systems is an important topic with direct environmental, economic, and social impact. Our paper is the first to explore the use of factor graph optimization techniques for leak localization in water distribution networks, enabling us to perform sensor fusion between pressure and demand sensor readings and to estimate the network's temporal and structural state evolution across all network nodes. The methodology introduces specific water network factors and proposes a new architecture composed of two factor graphs: a leak-free state estimation factor graph and a leak localization factor graph. When a new sensor reading is obtained, unlike Kalman and other interpolation-based methods, which estimate only the current network state, factor graphs update both current and past states. Results on Modena, L-TOWN and synthetic networks show that factor graphs are much faster than nonlinear Kalman-based alternatives such as the UKF, while also providing improvements in localization compared to state-of-the-art estimation-localization approaches. Implementation and benchmarks are available at https://github.com/pirofti/FGLL.
Related papers
- Explainable Fuzzy GNNs for Leak Detection in Water Distribution Networks [3.249485481362347]
Graph Neural Networks (GNNs) excel at capturing spatial-temporal dependencies in sensor data.<n>We propose an explainable GNN framework that integrates mutual information to identify critical network regions.<n>Our fuzzy graph neural network (FGENConv) achieved Graph F1 scores of 0.889 for detection and 0.814 for localization.
arXiv Detail & Related papers (2026-01-06T14:45:43Z) - AquaSentinel: Next-Generation AI System Integrating Sensor Networks for Urban Underground Water Pipeline Anomaly Detection via Collaborative MoE-LLM Agent Architecture [11.644739814142502]
AquaSentinel is a novel physics-informed AI system for real-time anomaly detection in urban underground water pipeline networks.<n>We introduce four key innovations: (1) strategic sparse sensor deployment at high-centrality nodes combined with physics-based state augmentation to achieve network-wide observability from minimal infrastructure.
arXiv Detail & Related papers (2025-11-19T20:53:50Z) - Graph Signal Generative Diffusion Models [74.75869068073577]
We introduce U-shaped encoder-decoder graph neural networks (U-GNNs) for graph signal generation using denoising diffusion processes.<n>The architecture learns node features at different resolutions with skip connections between the encoder and decoder paths.<n>We demonstrate the effectiveness of the diffusion model in probabilistic forecasting of stock prices.
arXiv Detail & Related papers (2025-09-21T21:57:27Z) - Physics-Guided Fair Graph Sampling for Water Temperature Prediction in River Networks [27.275941333873263]
This work introduces a novel graph neural networks (GNNs)-based method to predict stream water temperature.<n>It helps reduce model bias across locations of different income and education levels.
arXiv Detail & Related papers (2024-12-21T07:57:30Z) - GNN-LoFI: a Novel Graph Neural Network through Localized Feature-based
Histogram Intersection [51.608147732998994]
Graph neural networks are increasingly becoming the framework of choice for graph-based machine learning.
We propose a new graph neural network architecture that substitutes classical message passing with an analysis of the local distribution of node features.
arXiv Detail & Related papers (2024-01-17T13:04:23Z) - Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data.
The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
arXiv Detail & Related papers (2024-01-12T17:57:07Z) - TransGlow: Attention-augmented Transduction model based on Graph Neural
Networks for Water Flow Forecasting [4.915744683251151]
Hydrometric prediction of water quantity is useful for a variety of applications, including water management, flood forecasting, and flood control.
We propose atemporal forecasting model that augments the hidden state in Graph Convolution Recurrent Neural Network (GCRN) encoder-decoder.
We present a new benchmark dataset of water flow from a network of Canadian stations on rivers, streams, and lakes.
arXiv Detail & Related papers (2023-12-10T18:23:40Z) - Graph Neural Network-Based Anomaly Detection for River Network Systems [0.8399688944263843]
Real-time monitoring of water quality is increasingly reliant on in-situ sensor technology.
Anomaly detection is crucial for identifying erroneous patterns in sensor data.
This paper presents a solution to the challenging task of anomaly detection for river network sensor data.
arXiv Detail & Related papers (2023-04-19T01:32:32Z) - Energy-based Out-of-Distribution Detection for Graph Neural Networks [76.0242218180483]
We propose a simple, powerful and efficient OOD detection model for GNN-based learning on graphs, which we call GNNSafe.
GNNSafe achieves up to $17.0%$ AUROC improvement over state-of-the-arts and it could serve as simple yet strong baselines in such an under-developed area.
arXiv Detail & Related papers (2023-02-06T16:38:43Z) - Bandwidth-efficient distributed neural network architectures with
application to body sensor networks [73.02174868813475]
This paper describes a conceptual design methodology to design distributed neural network architectures.
We show that the proposed framework enables up to a factor 20 in bandwidth reduction with minimal loss.
While the application focus of this paper is on wearable brain-computer interfaces, the proposed methodology can be applied in other sensor network-like applications as well.
arXiv Detail & Related papers (2022-10-14T12:35:32Z) - Belief propagation for supply networks: Efficient clustering of their
factor graphs [0.0]
We consider belief propagation (BP) as an efficient tool for state estimation and optimization problems in supply networks.
We propose a systematic way to cluster loops of factor graphs such that the resulting factor graphs have no additional loops as compared to the original network.
arXiv Detail & Related papers (2022-03-01T14:01:35Z) - Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM)
EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments.
We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
arXiv Detail & Related papers (2022-02-05T02:31:01Z) - Spectral Embedding of Graph Networks [76.27138343125985]
We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure.
The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation.
arXiv Detail & Related papers (2020-09-30T04:59:10Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.