Geometric and Topological Inference

The book is subdivided into four parts and 11 chapters.^[2] The first part covers basic tools from topology needed in the study,^[3][4] including simplicial complexes, Čech complexes and Vietoris–Rips complex, homotopy equivalence of topological spaces to their nerves, filtrations of complexes, and the data structures needed to represent these concepts efficiently in computer algorithms. A second introductory part concerns material of a more geometric nature, including Delaunay triangulations and Voronoi diagrams, convex polytopes, convex hulls and convex hull algorithms, lower envelopes, alpha shapes and alpha complexes, and witness complexes.^[3]

With these preliminaries out of the way, the remaining two sections show how to use these tools for topological inference. The third section is on recovering the unknown space itself (or a topologically equivalent space, described using a complex) from sufficiently well-behaved samples.^[1][4] The fourth part shows how, with weaker assumptions about the samples, it is still possible to recover useful information about the space, such as its homology and persistent homology.^[1][3][4]

Although the book is primarily aimed at specialists in these topics, it can also be used to introduce the area to non-specialists, and provides exercises suitable for an advanced course.^[4][2] Reviewer Michael Berg evaluates it as an "excellent book" aimed at a hot topic, inference from large data sets,^[1] and both Berg and Mark Hunacek note that it brings a surprising level of real-world applicability to formerly-pure topics in mathematics.^[1][4]