On fiber diameters of continuous maps

We present a surprisingly short proof that for any continuous map $f : \mathbb{R}^n \rightarrow \mathbb{R}^m$, if $n>m$, then there exists no bound on the diameter of fibers of $f$. Moreover, we show that when $m=1$, the union of small fibers of $f$ is bounded; when $m>1$, the union of small fibers need not be bounded. Applications to data analysis are considered.Comment: 6 pages, 2 figure

An extension to VORO++ for multithreaded computation of Voronoi cells

VORO++ is a software library written in C++ for computing the Voronoi tessellation, a technique in computational geometry that is widely used for analyzing systems of particles. VORO++ was released in 2009 and is based on computing the Voronoi cell for each particle individually. Here, we take advantage of modern computer hardware, and extend the original serial version to allow for multithreaded computation of Voronoi cells via the OpenMP application programming interface. We test the performance of the code, and demonstrate that we can achieve parallel efficiencies greater than 95% in many cases. The multithreaded extension follows standard OpenMP programming paradigms, allowing it to be incorporated into other programs. We provide an example of this using the VoroTop software library, performing a multithreaded Voronoi cell topology analysis of up to 102.4 million particles.Comment: Fix typo and section number

Pair correlation function based on Voronoi topology

The pair correlation function (PCF) has proven an effective tool for analyzing many physical systems due to its simplicity and its applicability to simulated and experimental data. However, as an averaged quantity, the PCF can fail to capture subtle structural differences in particle arrangements, even when those differences can have a major impact on system properties. Here, we use Voronoi topology to introduce a discrete version of the PCF that highlights local inter-particle topological configurations. The advantages of the Voronoi PCF are demonstrated in several examples including crystalline, hyperuniform, and active systems showing clustering and giant number fluctuations.Comment: 8 pages, 9 figure

Identification of high-reliability regions of machine learning predictions in materials science using transparent conducting oxides and perovskites as examples

Progress in the application of machine learning (ML) methods to materials design is hindered by the lack of understanding of the reliability of ML predictions, in particular for the application of ML to small data sets often found in materials science. Using ML prediction for transparent conductor oxide formation energy and band gap, dilute solute diffusion, and perovskite formation energy, band gap and lattice parameter as examples, we demonstrate that 1) analysis of ML results by construction of a convex hull in feature space that encloses accurately predicted systems can be used to identify regions in feature space for which ML predictions are highly reliable 2) analysis of the systems enclosed by the convex hull can be used to extract physical understanding and 3) materials that satisfy all well-known chemical and physical principles that make a material physically reasonable are likely to be similar and show strong relationships between the properties of interest and the standard features used in ML. We also show that similar to the composition-structure-property relationships, inclusion in the ML training data set of materials from classes with different chemical properties will not be beneficial and will slightly decrease the accuracy of ML prediction and that reliable results likely will be obtained by ML model for narrow classes of similar materials even in the case where the ML model will show large errors on the dataset consisting of several classes of materials. Our work suggests that analysis of the error distributions of ML predictions will be beneficial for the further development of the application of ML methods in material science