 Research article
 Open Access
 Published:
A new topological descriptor for water network structure
Journal of Cheminformatics volume 11, Article number: 48 (2019)
Abstract
Bulk water molecular dynamics simulations based on a series of atomistic water potentials (TIP3P, TIP4P/Ew, SPC/E and OPC) are compared using new techniques from the field of topological data analysis. The topological invariants (the different degrees of homology) derived from each simulation frame are used to create a series of persistence diagrams from the atomic positions. These are averaged over the simulation time using the persistence image formalism, before being normalised by their total magnitude (the L1 norm) to ensure a size independent descriptor (L1NPI). We demonstrate that the L1NPI formalism is suitable for the analysis of systems where the number of molecules varies by at least a factor of 10. Using standard machine learning techniques, a basic linear SVM, it is shown that differences in water models are able to be isolated to different degrees of homology. In particular, whereas first degree homology is able to distinguish between all atomistic potentials studied, OPC is the only potential that differs in its second degree homology. The L1 normalised persistence images are then used in the comparison of a series of Stillinger–Weber potential simulations to the atomistic potentials and the effects of changing the strength of threebody interactions on the structures is easily evident in L1NPI space, with a reduction in variance of structures as interaction strength increases being the most obvious result. Furthermore, there is a clear tracking in L1NPI space of the λ parameter. The L1NPI formalism presents a useful new technique for the analysis of water and other materials. It is approximately sizeindependent, and has been shown to contain information as to real structures in the system. We finally present a perspective on the use of L1NPIs and other persistent homology techniques as a descriptor for water solubility.
Introduction
The water network problem
Understanding the structure and dynamics of water networks is an important task in a wide variety of fields. This is due to the anomalous behaviour of water, such as the wellknown density maximum. Further, these anomalies have been shown to play important roles in physical, chemical, and biological processes [1, 2]. There have therefore been many studies of simulated water systems, often looking at radial distribution functions [3] or spatial distribution functions [4]. In particular, the tetrahedral nature of local water has been investigated [5, 6].
This has led to a plethora of computational techniques for understanding water network structure. In general, these can be split into categories such as coordination number studies [3, 7,8,9] and graphtheoretical studies [10,11,12,13]. Both of these categories have drawbacks, namely the difficulty in interpreting data beyond nearest neighbours, and the requirement for a connectivity heuristic respectively.
Mathematical techniques drawn from topology look highly suitable to make progress in the analysis of connectivity. In particular, persistent homology is a recent development in mathematics, in the field of topological data analysis, and creates a multiscale representation of an arbitrary point cloud [14]. This is achieved by converting this point cloud into a filtration of topological structures, and observing how topological invariants change in this filtration. Persistence has found many uses in chemistry, mainly in proteins [15,16,17,18,19,20,21,22], but also as a small molecule descriptor [23, 24] or a descriptor for the analysis of crystal structures and other materials [25,26,27,28,29,30]. Furthermore, persistent homology has recently been applied to understanding water networks [31] however these methods did not take into account the dynamic nature of such systems.
In this work, we develop the ideas discussed in [31] and by the use of persistence images [32] are able to develop what we term l_{1}normalised persistence images (L1NPIs) which take into account the dynamic nature of the molecular dynamics simulations. These descriptors are sizeagnostic, meaning they can be used between systems with vastly different numbers of water molecules, and are wellsuited for machine learning techniques. We apply this technique to a range of atomistic water models and a coarsegrained Stillinger–Weber (SW) potential [33], and using this technique are able to not only distinguish between these models, but relate these differences to the underlying water network. We lastly present a perspective as to how this technique can be used to understand the solute–solvent interaction, as well as potential challenges and pitfalls.
Theory
Rather than present the fundamentals of persistent homology (see references [34,35,36,37] for introductions to the field), we will instead present a ‘greatest hits', where we will aim to give the reader a basic understanding, while paying little attention to the man behind the curtain.
Persistent homology
In mathematics, homology is the general method of counting ‘holes’ in a space. Persistent homology is an extension developed to understand the holes in a data set. Consider the sampling process, as is illustrated in Fig. 1 individual observations are taken from some arbitrary space, and observed in some lowdimensional projection. We seek to understand the structure of the original space from its sampled points. However, the sampled points themselves have a topology which is trivial, there are \(n_{points}\) connected components, and nothing else. To see a more interesting topology, we must ‘join up’ the points in some way. There are obviously a wide range of potential methods for this. In this work, we use the Vietoris–Rips (VR) complex. The VR complex requires a single parameter δ, and is defined on a data set \(S\) as follows:
Definition 1
For every pair of points in (x, y) in S, if d(x, y)<, we draw a line between x and y. If every pair in a triplet (quartet, etc.) is connected, we draw the triangle (tetrahedron, etc.) between them.
An example data set and its associated VR complex can be seen in Fig. 2. The VR complex is relatively easy to compute, as it requires knowledge only about pairs of points. Given a VR complex, we can study its topology. As mentioned, homology is the method of ‘counting holes’ in a space. Mathematically, we calculate the Betti numbers \(\beta_{n}\) of the space. For a given n a description of \(\beta_{n}\) as well as the values for a sphere and torus, can be found in Table 1.
The final ingredient of persistent homology is the ‘persistence’. One may ask—What is the best value of to define a VR complex on a data set? Persistent homology answers: all of them. By considering how the topology of the VR complex changes as we go through a range of δ, we hope to gain understanding as the structure of the underlying set of points. Any hole born at \(t\) must be filled in by some \(t '\). Therefore, we represent the persistent homology of a set of points by considering when topological features are born and when they die, in a persistence diagram.
For a regular hexagon, with nearest neighbour distance of d (Fig. 3), the persistence diagram can be seen in Fig. 4. At \(\delta = 0\), we have 6 separate connected components. However, when \(\delta = d\) these components merge to form a single component—5 (zeroth degree) components born at 0 die at d. Furthermore, in this merging, a loop (first degree component) is born. This loop persists until \(\delta = \sqrt 3 d\) where now nextnearest neighbours join. This loop now dies, and the VR complex has the topology of a sphere. The sphere lives until \(\delta = 2d\), where nextnextnearest neighbours join, filling in the sphere. An animation, demonstrating the various stages of the persistence diagram, can be found at [38]. All persistent homology calculations in this work were performed using the Gudhi library in Python [39].
Persistence images
For this work, we will be trying to understand simulated water networks through the lens of persistent homology. Rather than comparing descriptors computed from single frames of simulation, which would be susceptible to noise, we would like to use a notion of average persistence. However, the persistence diagram is not wellsuited to such a task (for more details we direct the reader to [40], particularly Fig. 3 therein). Therefore, there have been many attempts to construct vector representations of persistence diagrams that can have statistical techniques applied to them, including persistence landscapes [40, 41], kernel embeddings [42], and persistence images [32]. In this work, we use the persistence image, which transforms a single persistence diagram into a literal grayscale image. Furthermore, calculating the average of a set of images is as simple as finding the average value for each pixel. Lastly, persistence images are relatively simple to interpret, as they look similar to the persistence diagram.
The procedure of transforming a persistence diagram to a persistence image is as follows:

1.
Select a single degree of homology

2.
Transform each point of this degree from \(\left( {b,d} \right)\) to \(\left( {b,p} \right),\) where \(p = d  b\)

3.
For each point \(\left( {b,p} \right),\) define the function:
$$g\left( {x,y} \right) = \frac{1}{{2\pi\sigma^{2} }}\exp \left( {\frac{{  \left( {\left( {x  b} \right)^{2} + \left( {y  p} \right)^{2} } \right)}}{{2\pi\sigma^{2} }}} \right)$$ 
4.
Multiply each function \(g\left( {x,y} \right)\) by \(\phi \left( {x,y} \right)\), where \(\phi\left( {x,0} \right) = 0.\) This is done for stability reasons, and is discussed in more detail in [32]

5.
Integrate \(g\left( {x,y} \right)\phi\left( {x,y} \right)\), over a collection of pixels

6.
The persistence image I is this discretisation of \(g\left( {x,y} \right)\phi\left( {x,y} \right)\)
For a noisy circular data set (Fig. 5) the persistence diagram and 1st degree persistence image can be seen in Figs. 6 and 7 respectively. The persistence images in this work were computed using an inhouse code, but can be calculated using libraries such as persim in Python. All persistence images in this code were calculated on a 50 × 50 grid of pixels.
Simulation details
A brief summary is given here for the molecular dynamics simulations and for more information about simulation details, please refer to the Additional file 1.
Atomistic potentials
The potentials used in this study are the commonly used TIP3P [43] and TIP4P/Ew [44] potentials, the SPC/E potential [45], and the more recent OPC potential. All of these potentials are fixed, therefore their dynamics are determined entirely by their intermolecular forces. Of these potentials, TIP3P and SPC/E are 3site potentials, whereas TIP4P/Ew and OPC are both 4site potentials. Table 2 contains details as to the parameters used for all the potentials. All simulations were performed using the AMBER 16 package [46]. Simulations were performed at a wide range of temperatures, at 1 atm pressure. This work only analyses the simulations performed at 300 K.
The Stillinger–Weber potential
In contrast, the SW potential is a coarsegrained potential. Originally parameterised for Silicon in 1983 [33] the SW potential has been shown to be incredibly versatile, as can be seen from its general functional form [47]:
It is clear that the λ parameter allows the tuning of the relative strength of the 3body interaction. The 2body interaction models a steep repulsion at short distances, as well as a potential well:
Whereas the 3body interaction can be considered to be an intermolecular bond stretch, as a harmonic spring as well as a distance factor:
In this work, we use the parameters A = 7.049556277, B = 0.6022245584, p = 4, q = 0, \(\cos \theta_{0} = \frac{1}{3}\), γ = 1.2, and a = 1.8. All simulations of the SW potential were performed at the ambient temperature and pressure corresponding to the melting temperature at that particular λ.
Persistent homology procedure for water simulations
Persistent homology
Given a single frame of a simulation, we use the locations of the oxygen atoms as our point cloud. This leads to a substantially quicker computation time, as we are reducing the number of points in our system by 2/3. This decision also makes sense from a theoretical perspective, namely that it is the tetrahedral nature of the oxygen lattice which is of interest, and including the hydrogen atoms as equal in the persistent homology would likely ‘wash out' this information, and instead simply capture the persistent of densely sampled Euclidean 3space. We note that this procedure is much simpler than the element specific persistent homology of Cang and Wei [16] and the multiparameter persistence of PHoS developed by Keller, Lesnick and Willke [48]. However, the relative simplicity of our systems compared to the druglike biomolecules used in their work allows us to use such a simple procedure. Furthermore, our procedure naturally extends to the coarsegrained SW potential. For each degree of homology separately, we calculate the persistent homology for every frame of simulation, before converting each persistence diagram into a persistence image.
L1normalised persistence images
One of the fundamental properties of a potential descriptor for water structure is that it is sizeindependent. Provided two systems are large enough such that bulk behaviour dominates, we would like to be unable to separate two systems of different sizes using the structural descriptor. This is a problem for persistent homology, where the number of persistent features is clearly dependent on the number of points in the system. In persistence images, this property is the integral of the image. We therefore define the L_{1}normalised persistence image (L1NPI) as:
where \(I\left[ {i,j} \right]\) is the value of the persistence image at the pixel with index \(\left[ {i,j} \right].\) The most significant consequence of this definition is that the mean LINPI is not equal to the L_{1}normalised mean persistence image. We do not explore this discrepancy in our work.
Comparison to other techniques
The radial distribution function (RDF) is a standard tool when analysing simulations of materials, such as the water networks discussed in this work. The RDF describes the relative density of water molecules as a function of distance, and allows the discovery of solvation shells. The RDF has previously been used to compare different water models such as in [3], where it was shown that the slight differences in LennardJones and Coulombic terms led to pronounced changes in density of secondnearest neighbours. An extension of the RDF, the spatial distribution function (SDF) was developed, which does not integrate out the angular distribution in the manner of the RDF. The SDF, when applied to SPC/E water, led to the discussion of two different motifs, a temperature independent tetrahedral water, and a nontetrahedral structure that appeared to vary with temperature [4].
Persistent homology is a more complex and rich tool for analysing these structures. Rather than simply studying the relative positions of pairs of water molecules, the simplicial complex required in persistent homology contains information about groups of water molecules. For example, the presence of the triangle abc in the simplicial complex requires all pairs ab, ac, bc, to be within a particular distance of each other. This leads to information that can be related to the RDF—the nearest neighbour distance can be estimated using zerothdegree homology—but also information that is not so easily extracted from either the RDF or SDF—such as the presence of rings of water structures.
Results and discussion
Comparison of persistence images and L1NPIs
To demonstrate the usefulness of the L1NPI versus the standard persistence image, we investigate the performance of a linear SVM classifier on systems of the same potential, with different numbers of water molecules. Firstly, the L1NPI matrix is flattened into a highdimensional vector in \({\mathbb{R}}^{2500}\). A sizeindependent descriptor would perform badly on this classification task, as it would not be able to distinguish between the only difference in the systems. We present the confusion matrices for these classifiers for both the first degree persistence images and L1NPIs for simulations of TIP3P water at 300K with varying numbers of water atoms in the system in Figs. 8 and 9 respectively. It is clear that the standard persistence image SVM performs well in this classification task, and that it can distinguish between systems based on the number of water molecules present. However, the L1NPI performs much worse at this task, and can be seen to be essentially randomly guessing between 3 classes.
To explain the performance of these classifiers, we have performed PCA on the persistence image and L1NPI spaces, with the twodimensional projections in Figs. 10 and 11 respectively. Clearly, the persistence images form a trend with the number of water molecules in the system, which is far less prominent in the L1NPI. We can conclude from this that the L1NPI is much more size independent than the standard persistence image. However, this is not a total sizeindependence, as there is likely to always be some finitesize effect in persistent homology.
Comparison of atomistic potentials
The SVM classifier formalism can also be used to analyse differences between the atomistic potentials. We would expect any differences to be subtle here, as they are ostensibly modelling the same system. The confusion matrices for first and second degree homology at 300 K for these systems can be seen in Figs. 12 and 13 respectively. First degree homology is able to correctly classify different atomistic potentials with 98.7% accuracy. In contrast, second degree homology performs with 60.6% accuracy. Interestingly, this accuracy is not consistent amongst the potentials studied. In particular, OPC is correctly classified 99.4% of the time, whereas TIP4PEw has only 34% accuracy.
We are able to analyse these systems further using principal component analysis (PCA). We project the L1NPI vectors onto the first two principal components of the system, which can be seen in Figs. 14 and 15 for first and second degree L1NPIs respectively. Firstly, we can state that the major differences in structure are clearly coming from first degree homology. This is reflected in the greater separations of potentials in first degree homology. Furthermore, we recover the wellknown fact that TIP4P/Ew and SPC/E are more similar than TIP3P.
Using PCA, it is immediately apparent that OPC can be distinguished in second degree homology, whereas the other potentials studied cannot. Using the discovered coefficients of the SVM classifier, we are able to recover the L1NPIlike image that represents the separating hyperplane (such an image is L1NPIlike as pixels are allowed to take negative values, unlike in a L1NPI. It is the absolute value of the pixels in the separating hyperplane image that corresponds to their importance to the classifier). For OPC, this hyperplane image can be seen in Fig. 16. It is clear that the distinguishing characteristics for OPC is the presence of more points of low persistence, with a lack of points of high persistence.
Comparison of series of Stillinger–Weber potentials
As the SW simulations derive from a series of related potentials differing in one main parameter we can investigate how the topological analysis is related to this parameter. A series of simulations for the Stillinger–Weber potential were performed at different values of the λ parameter. The projection of L1NPI space onto its first two principal components can be seen in Figs. 17 and 18 for first and second degree homology respectively. Firstly, we note that the differences in L1NPI space are much more pronounced with the value of λ changing than previously shown for the different atomistic water potentials. This is expected, as the different atomistic potentials are ostensibly modelling the same system, whereas the SW potential has been derived to simulate vastly different systems depending on λ. We also see the same behaviour that differences are more pronounced in first than second degree homology. This can be explained by the following argument. In a relatively dense point cloud, such as the ones being studied in this work, it is a reasonable first approximation to associate the nearestneighbour distance to the birth value of first degree homology, nextnearest neighbour distance to the death value of first degree homology, and the birth value of second degree homology, and so on. It is clear that as we look at interactions beyond nearest neighbour, interactions become less directional, and the distribution of distances becomes wider [49]. This is reflected in an increase of similarity of persistence.
It is also interesting to note that the distribution of points in L1NPI space narrows as λ increases. This suggests a reduction in the variance of the persistent homology. As λ increases, the relative strength of the threebody interaction defined in the SW potential increases. This leads to a reduction in the variance of nextnearest neighbour distances, which is then reflected in the persistence.
Comparison of atomistic and Stillinger–Weber potentials
Lastly, we will present a comparison between the atomistic and SW potentials using the L1NPI formalism. Figures 19 and 20 show the first two principal components of first and second degree L1NPI space for a selection of values of λ and the previously used atomistic potentials. In both degrees, it is clear that the atomistic potentials do not lie on the same line as the SW potential simulations, and as mentioned before they are closer to each other than variations in λ. Again, this suggests that the differences in atomistic potential lead to more subtle changes in structure than altering λ, and the differences in structure between atomistic potentials are not the same as the differences in structure in SW potential simulations.
We note that in first degree homology, the atomistic potential simulations are closest to the value of λ = 23.15. This is the value of λ that is considered to lead to waterlike structures, as it reproduces the density profile of water on a range of temperatures. Interestingly, this is not the case in second degree homology, where the L1NPI descriptor suggests that the atomistic systems are more similar to λ = 23.95, with OPC being closest to λ = 23.15. This separation of degrees of homology is a useful property of the L1NPI analysis, where we are able to say that although the atomistic structures have the same ‘loops’ of the SW structures, they do not match the ‘holes’, with OPC being the closest.
We finally return to the sizeindependent nature of our L1NPI descriptor. Whereas the atomistic potentials have in excess of 4000 water molecules, the simulations of the SW potential have 512. However, the L1NPI descriptor can be used to compare such systems, irrespective of system size. We do note that there is one consequence of size in the L1NPI formalism, which can be seen in the PCA images. Namely, systems with more molecules lead to a tighter distribution of points in L1NPI space. Considering a single frame of a simulation, we note that more molecules will lead to more points in the persistence diagram, which will become more ‘filled in’. This implies that the individual persistence diagrams (and therefore images and L1NPIs) will be more similar to each other in simulations with a larger number of particles. Therefore, the L1NPI descriptor is not entirely sizeindependent, although it is far more size independent than other persistence representations.
Conclusion
We have derived a new descriptor for water network structure, using topological data analysis. By applying persistent homology, the study of holes in data, to the point cloud defined by oxygen atom coordinates, we are able to gain insight as to what distinguishes various structures created by different intermolecular potentials. Whereas more commonly used techniques, such as persistence landscapes [40] are unable to be used on systems of widely varying sizes, we have shown that our technique, the L_{1}normalised persistence image (L1NPI) is relatively sizeindependent.
We first applied the L1NPI formalism to four commonly used atomistic potentials: TIP3P, TIP4P/Ew, SPC/E and OPC. We were able to determine that first degree homology (i.e. loops) were enough to distinguish between these potentials, even with a relatively simple linear support vector machine. In contrast, second degree homology (holes) was only able to distinguish between OPC and the other models. We consider this to be a consequence OPC’s rather unique parameterisation technique. We are also able to show that TIP4P/Ew and SPC/E are more similar than the other atomistic models, purely based on their proximity in L1NPI space.
We then investigated a series of Stillinger–Weber potentials. By tuning the parameter λ, the relative strength of the threebody interaction can be altered. The L1NPI formalism showed that differences in structure caused by changing λ are much more pronounced than those found in the atomistic potentials. Furthermore, we were able to relate properties such as nearest neighbour distances to observations in L1NPI space.
We finally compared the atomistic systems to the Stillinger–Weber potential series. We noticed that in first degree homology, the atomistic structures are closest to the widely accepted value of λ = 23.15. In contrast, second degree homology suggests that the structures are closer to slightly higher values of λ, with OPC being closest to 23.15. Furthermore, by comparing systems of widely different sizes (512 vs. 4000 water molecules), we show that the L1NPI formalism is sizeindependent.
It would be interesting to study generalisations of the persistence image to other means, rather than simply the L1 norm, as a method of future work. The use of generalised meanbased descriptors is well established, such as in [50, 51], and we feel that different means could be able to account for other discrepancies than system size.
We conclude by discussing the application of the L1NPI formalism to the solubility problem, Although it is widely accepted that there is a need to produce better models (as evidenced by the ‘Solubility Challenge’ [52, 53]) models are still unable to accurately predict water solubility [53]. We feel that a large amount of research is invested in producing models with more complex designs. This, coupled with the lack of highquality solubility data, leads to overfitted models, as well as poor interpretability. However, the L1NPI formalism could be applied to solute–solvent systems, and in particular differences in L1NPIs could be related to perturbations of the water network. We plan to expand upon this problem further in a future publication.
Availability of data and material
All software used in this work is either opensourced, or a reference given to an opensource implementation. Key software components are included in the supplementary material. Copies of coordinate files for the simulations are available on request.
Change history
07 August 2019
It was highlighted that the original article [1] was missing Additional files 2 and 3.
References
Eisenberg DS, Kauzmann W (2005) The structure and properties of water. Clarendon Press, Oxford
Stillinger FH (1995) A topographic view of supercooled liquids and glass formation. Science 267(5206):1935–1939
Mark P, Nilsson L (2001) Structure and dynamics of the TIP3P, SPC, and SPC/E water models at 298 K. J Phys Chem A 105(43):9954–9960
Svishchev IM, Kusalik PG (1993) Structure in liquid water: a study of spatial distribution functions. Comparison of simple potential functions for simulating liquid water. J Chem Phys 99(10):24516
Wernet P et al (2004) The structure of the first coordination shell in liquid water. Science 304(5673):995–999
HeadGordon T, Johnson ME (2006) Tetrahedral structure or chains for liquid water. Proc Natl Acad Sci USA 103(21):7973–7977
HeadGordon T, Hura G (2002) Water structure from scattering experiments and simulation. Chem Rev 102(8):2651–2670
Rahman A, Stillinger FH (1971) Molecular dynamics study of liquid water. J Chem Phys 55(7):3336–3359
Rahman A, Stillinger FH (1973) Hydrogenbond patterns in liquid water. J Am Chem Soc 95(24):7943–7948
Mooney BL, Corrales LR, Clark AE (2012) MoleculaRnetworks: an integrated graph theoretic and data mining tool to explore solvent organization in molecular simulation. J Comput Chem 33(8):853–860
Batista da Silva JA, Moreira FGB, Leite dos Santos VM, Longo RL (2011) On the hydrogen bond networks in the water–methanol mixtures: topology, percolation and smallworld. Phys Chem Chem Phys 13(14):6452
Bakó I, Megyes T, Bálint S, Grósz T, Chihaia V (2008) Water–methanol mixtures: topology of hydrogen bonded network. Phys Chem Chem Phys 10(32):5004
dos Santos VML, Moreira FGB, Longo RL (2004) Topology of the hydrogen bond networks in liquid water at room and supercritical conditions: a smallworld structure. Chem Phys Lett 390(1–3):157–161
Edelsbrunner H, Letscher D, Zomorodian A (2002) Topological persistence and simplification. Discrete Comput Geom 28(4):511–533
Cang Z, Wei GW (2017) Topological fingerprints reveal proteinligand binding mechanism. https://arxiv.org/abs/1703.10982
Cang Z, Wei GW (2018) Integration of element specific persistent homology and machine learning for proteinligand binding affinity prediction. Int J Numer Meth Biomed Eng 34:e2914
KovacevNikolic V, Bubenik P, Nikolić D, Heo G (2016) Using persistent homology and dynamical distances to analyze protein binding. Stat Appl Genet Mol Biol 15(1):19–38
Xia K, Wei GW (2014) Persistent homology analysis of protein structure, flexibility, and folding. Int J Numer Method Biomed Eng 30(8):814–844
Emmett K, Schweinhart B, Rabadan R (2016) Multiscale topology of chromatin folding. In: Proceedings of the 9th EAI international conference on bioinspired information and communications technologies (formerly BIONETICS), 2016, pp 177–180
Gameiro M et al (2015) A topological measurement of protein compressibility. Jpn J Ind Appl Math 32:1–17
Nikolić D, KovačevNikolić V (2017) Dynamical persistence of active sites identified in maltosebinding protein. J Mol Model 23(5):167
Haspel N, Luo D, González E (2017) Detecting intermediate protein conformations using algebraic topology. BMC Bioinform 18(S15):502
Cang Z, Wei GW (2017) TopologyNet: topology based deep convolutional and multitask neural networks for biomolecular property predictions. PLoS Comput Biol 13(7):1–27
Xia K, Opron K, Wei GW (2013) Multiscale multiphysics and multidomain models—flexibility and rigidity. J Chem Phys 139:194109
Lee Y, Barthel SD, Dłotko P, Moosavi SM, Hess K, Smit B (2017) Poregeometry recognition: on the importance of quantifying similarity in nanoporous materials. https://arxiv.org/abs/1701.06953
Hiraoka Y et al (2016) Hierarchical structures of amorphous solids characterized by persistent homology. Proc Natl Acad Sci USA 113(26):7035–7040
Nakamura T, Hiraoka Y, Hirata A, Escolar EG, Nishiura Y (2015) Persistent homology and manybody atomic structure for mediumrange order in the glass. Nanotechnology 26(30):304001
Ichinomiya T, Obayashi I, Hiraoka Y (2017) Persistent homology analysis of craze formation. Phys Rev E 95(1):012504
Saadatfar M, Takeuchi H, Robins V, Francois N, Hiraoka Y (2017) Pore configuration landscape of granular crystallization. Nat Commun 8:15082
Buchet M, Hiraoka Y, Obayashi I (2018) Persistent homology and materials informatics. In: Tanaka I (ed) Nanoinformatics. Springer, Singapore, pp 75–95
Xia K (2018) Persistent homology analysis of ion aggregations and hydrogenbonding networks. Phys Chem Chem Phys 20(19):13448–13460
Adams H et al (2017) Persistence images: a stable vector representation of persistent homology. J Mach Learn Res 18:1–35
Stillinger FH, Weber TA (1985) Computer simulation of local order in condensed phases of silicon. Phys Rev B 31(8):5262–5271
Ghrist R (2007) Barcodes: the persistent topology of data. Bull Am Math Soc 45(01):61–76
Cang Z, Wei GW (2017) Analysis and prediction of protein folding energy changes upon mutation by element specific persistent homology. Bioinformatics 33(22):3549–3557
Cang Z, Mu L, Wei GW (2018) Representability of algebraic topology for biomolecules in machine learning based scoring and virtual screening. PLoS Comput Biol 14(1):e1005929
Xia K, Li Z, Mu L (2018) Multiscale persistent functions for biomolecular structure characterization. Bull Math Biol 80(1):1–31
Steinberg L (2019) Rips complex persistence on hexagon. https://figshare.com/articles/Rips_complex_persistence_on_hexagon/7830608. Accessed 12 Mar 2019
Maria C, Boissonnat JD, Glisse M, Yvinec M (2014) The Gudhi library: simplicial complexes and persistent homology. In: International congress on mathematical software. Springer, Berlin, 2014, pp 167–174
Bubenik P (2015) Statistical topological data analysis using persistence landscapes. J Mach Learn Res 16:77–102
Bubenik P, Dłotko P (2017) A persistence landscapes toolbox for topological statistics. J Symb Comput 78:91–114
Kusano G, Fukumizu K, Hiraoka Y (2017) Kernel method for persistence diagrams via kernel embedding and weight factor. J Mach Learn Res 18(1):6947–6987
Jorgensen WL, Chandrasekhar J, Madura JD, Impey RW, Klein ML (1983) Comparison of simple potential functions for simulating liquid water. J Chem Phys 79(52):926–10089
Horn HW et al (2004) Development of an improved foursite water model for biomolecular simulations: TIP4PEw. J Chem Phys 120(20):9665–9678
Berendsen H, Grigera J, Straatsma T (1987) The missing term in effective pair potentials. J Phys Chem 91:6269–6271
Pearlman DA et al (1995) AMBER, a package of computer programs for applying molecular mechanics, normal mode analysis, molecular dynamics and free energy calculations to simulate the structural and energetic properties of molecules. Comput Phys Commun 91(1–3):1–41
Russo J, Akahane K, Tanaka H (2018) Waterlike anomalies as a function of tetrahedrality. Proc Natl Acad Sci USA 115:E3333–E3341
Keller B, Lesnick M, Willke TL, Albany S, Willke T (2018) PHoS: persistent homology for virtual screening. https://chemrxiv.org/articles/PHoS_Persistent_Homology_for_Virtual_Screening/6969260/1
Mason PE, Brady JW (2007) Tetrahedrality and the relationship between collective structure and radial distribution functions in liquid water. J Phys Chem B 111(20):5669–5679
Barigye SJ et al (2013) Eventbased criteria in GTSTAF information indices: theory, exploratory diversity analysis and QSPR applications. SAR QSAR Environ Res 24(1):3–34
GarcíaJacas CR, ContrerasTorres E, MarreroPonce Y, PupoMeriño M, Barigye SJ, CabreraLeyva L (2016) Examining the predictive accuracy of the novel 3D Nlinear algebraic molecular codifications on benchmark datasets. J Cheminform 8(1):10
Llinàs A, Glen RC, Goodman JM (2008) solubility challenge: can you predict solubilities of 32 molecules using a database of 100 reliable measurements? J Chem Inf Model 48(7):1289–1303
Hopfinger AJ, Esposito EX, Llinàs A, Glen RC, Goodman JM (2009) Findings of the challenge to predict aqueous solubility. J Chem Inf Model 49:1–5
Acknowledgements
The authors thank Jacek Brodzki, Mariam Pirashvili and Francisco Belchi for helpful discussions. L.S. thanks Dr Francis Longford for helpful discussions. The authors also acknowledge the use of the IRIDIS High Performance Computing Facility in the completion of this work.
Funding
This research was supported by EPSRC Grants EP/N014189/1 Joining the dots: from data to insight, and L.S. thanks the EPSRC for the studentship support through the Centre for Doctoral Training in Theory and Modelling in Chemical Sciences EP/L015722/1. J.R. acknowledges support from the European Research Council Grant DLV759187 and the Royal Society University Research Fellowship.
Author information
Authors and Affiliations
Contributions
JGF designed the study with contributions from LS and JR Simulations of atomistic potentials were performed by LS, and the Stillinger–Weber potential simulations were performed by JR Analysis pipeline was designed and implemented by LS Results were analyzed by all authors. The manuscript was written by LS with contributions from all authors. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Ethics approval and consent to participate
Not applicable.
Consent for publication
Not applicable.
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Additional file
Additional file 1.
Python programs for computation of persistence.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
About this article
Cite this article
Steinberg, L., Russo, J. & Frey, J. A new topological descriptor for water network structure. J Cheminform 11, 48 (2019). https://doi.org/10.1186/s1332101903690
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s1332101903690
Keywords
 Persistent homology
 Water networks
 Topological data analysis