Topological Taxonomy of Water Distribution Networks

Water Distribution Networks (WDNs) can be regarded as complex networks and modeled as graphs. In this paper, Complex Network Theory is applied to characterize the behavior of WDNs from a topological point of view, reviewing some basic metrics, exploring their fundamental properties and the relationship between them. The crucial aim is to understand and describe the topology of WDNs and their structural organization to provide a novel tool of analysis which could help to find new solutions to several arduous problems of WDNs. The aim is to understand the role of the topological structure in the WDNs functioning. The methodology is applied to 21 existing networks and 13 literature networks. The comparison highlights some topological peculiarities and the possibility to define a set of best design parameters for ex-novo WDNs that could also be used to build hypothetical benchmark networks retaining the typical structure of real WDNs. Two well-known types of network ((a) square grid; and (b) random graph) are used for comparison, aiming at defining a possible mathematical model for WDNs. Finally, the interplay between topology and some performance requirements of WDNs is discussed.

[1]  Carlo Giudicianni,et al.  Water Supply Network Partitioning Based On Weighted Spectral Clustering , 2016, COMPLEX NETWORKS.

[2]  Joaquín Izquierdo,et al.  An approach to water supply clusters by semi-supervised learning , 2010 .

[3]  A. Lodi,et al.  On the optimal design of water distribution networks: a practical MINLP approach , 2012 .

[4]  Dragoš Cvetković,et al.  GRAPH SPECTRAL TECHNIQUES IN COMPUTER SCIENCES , 2012 .

[5]  Almerima Jamakovic,et al.  On the relationships between topological measures in real-world networks , 2008, Networks Heterog. Media.

[6]  Brendan D. McKay,et al.  Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.

[7]  Paul Jeffrey,et al.  Complex network analysis of water distribution systems , 2011, Chaos.

[8]  Leonardo Dueñas-Osorio,et al.  Exploring Topological Effects on Water Distribution System Performance Using Graph Theory and Statistical Models , 2017 .

[9]  Antonio Manuel,et al.  Improving water network management by efficient division into supply clusters , 2011 .

[10]  Paul Jeffrey,et al.  ROBUSTNESS AND VULNERABILITY ANALYSIS OF WATER DISTRIBUTION NETWORKS USING GRAPH THEORETIC AND COMPLEX NETWORK PRINCIPLES , 2011 .

[11]  Larry W. Mays,et al.  Water distribution systems handbook , 2012 .

[12]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[13]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[14]  D. H. Marks,et al.  Water Distribution Reliability: Analytical Methods , 1988 .

[15]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[16]  Juan Martínez,et al.  Genetic algorithms for the design of looped irrigation water distribution networks , 2006 .

[17]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[18]  A. Levine,et al.  Surfing the p53 network , 2000, Nature.

[19]  Avi Ostfeld,et al.  Battle of Water Networks DMAs: Multistage Design Approach , 2017 .

[20]  Avi Ostfeld,et al.  The Battle of the Water Sensor Networks (BWSN): A Design Challenge for Engineers and Algorithms , 2008 .

[21]  Carlo Giudicianni,et al.  Scaling-Laws of Flow Entropy with Topological Metrics of Water Distribution Networks , 2018, Entropy.

[22]  J. Levine,et al.  Surfing the p53 network , 2000, Nature.

[23]  Anna Scaglione,et al.  Generating Statistically Correct Random Topologies for Testing Smart Grid Communication and Control Networks , 2010, IEEE Transactions on Smart Grid.

[24]  Victor H. Alcocer-Yamanaka,et al.  Graph Theory Based Algorithms for Water Distribution Network Sectorization Projects , 2008 .

[25]  Antonietta Simone,et al.  Redundancy Features of Water Distribution Systems , 2017 .

[26]  Hanif D. Sherali,et al.  Effective Relaxations and Partitioning Schemes for Solving Water Distribution Network Design Problems to Global Optimality , 2001, J. Glob. Optim..

[27]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[28]  Larry W. Mays,et al.  Battle of the network models: Epilogue , 1987 .

[29]  D. B. Khang,et al.  A two‐phase decomposition method for optimal design of looped water distribution networks , 1990 .

[30]  I. Goulter,et al.  Reliability-constrained pipe network model , 1990 .

[31]  William B. Rouse.  Complex Engineered, Organizational and Natural , 2007 .

[32]  Ernesto Estrada,et al.  Network robustness to targeted attacks. The interplay of expansibility and degree distribution , 2006 .

[33]  C. M. Fontanazza,et al.  A model of the filling process of an intermittent distribution network , 2010 .

[34]  Johannes Gessler.  Pipe Network Optimization by Enumeration , 1985 .

[35]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[36]  Mudasser Iqbal,et al.  Automated sub-zoning of water distribution systems , 2014, Environ. Model. Softw..

[37]  R. Farmani,et al.  Evolutionary multi-objective optimization in water distribution network design , 2005 .

[38]  Menachem Elimelech,et al.  Advanced Materials, Technologies, and Complex Systems Analyses: Emerging Opportunities to Enhance Urban Water Security. , 2017, Environmental science & technology.

[39]  Sang-Il Lee,et al.  Genetic Algorithms for Optimal Augmentation of Water Distribution Networks , 2001 .

[40]  Avi Ostfeld,et al.  Battle of the Water Networks II , 2014 .

[41]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[42]  Ezio Todini,et al.  Looped water distribution networks design using a resilience index based heuristic approach , 2000 .

[43]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[44]  Dragan Savic,et al.  Simplified Approach to Water Distribution System Management via Identification of a Primary Network , 2018 .

[45]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[46]  Paul Erdös,et al.  On random graphs, I , 1959 .

[47]  W. T. Tutte.  Connectivity in graphs , 1966 .

[48]  Antonio Scala,et al.  Networks of Networks: The Last Frontier of Complexity , 2014 .

[49]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[50]  T. Devi Prasad,et al.  Multiobjective Genetic Algorithms for Design of Water Distribution Networks , 2004 .

[51]  A. Nardo,et al.  Spectral analysis and topological and energy metrics for water network partitioning of Skiathos island , 2017 .

[52]  Istvan Lippai.  Colorado Springs Utilities Case Study: Water System Calibration / Optimization , 2005 .

[53]  Jakobus E. van Zyl,et al.  Operational Optimization of Water Distribution Systems using a Hybrid Genetic Algorithm , 2004 .

[54]  Nicholas C. Wormald,et al.  Generating Random Regular Graphs , 1984, J. Algorithms.

[55]  U. Shamir,et al.  Design of optimal water distribution systems , 1977 .

[56]  M. A. Muñoz,et al.  Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that , 2006, cond-mat/0605565.

[57]  Antonietta Simone,et al.  Network structure classification and features of water distribution systems , 2017 .

[58]  Guido Caldarelli,et al.  Complexity Science for Sustainable Smart Water Grids , 2016, WIVACE.

[59]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[60]  William B. Rouse,et al.  Complex engineered, organizational and natural systems , 2007, Syst. Eng..

[61]  Carlo Giudicianni,et al.  Water Distribution System Clustering and Partitioning Based on Social Network Algorithms , 2015 .