Geometric and Topological Inference

Last updated
First edition Geometric and Topological Inference.jpg
First edition

Geometric and Topological Inference is a monograph in computational geometry, computational topology, geometry processing, and topological data analysis, on the problem of inferring properties of an unknown space from a finite point cloud of noisy samples from the space. It was written by Jean-Daniel Boissonnat, Frédéric Chazal, and Mariette Yvinec, and published in 2018 by the Cambridge University Press in their Cambridge Texts in Applied Mathematics book series. The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries. [1]

Contents

Topics

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]

Audience and reception

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]

Related Research Articles

Discrete mathematics Study of discrete mathematical structures

Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics – such as integers, graphs, and statements in logic – do not vary smoothly in this way, but have distinct, separated values. Discrete mathematics therefore excludes topics in "continuous mathematics" such as calculus or Euclidean geometry. Discrete objects can often be enumerated by integers. More formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics." Indeed, discrete mathematics is described less by what is included than by what is excluded: continuously varying quantities and related notions.

Topology Branch of mathematics that deals with continuous deformations

In mathematics, topology is concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing holes, opening holes, tearing, gluing, or passing through itself.

Algebraic topology Branch of mathematics

Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces. The basic goal is to find algebraic invariants that classify topological spaces up to homeomorphism, though usually most classify up to homotopy equivalence.

Convex hull The smallest convex set containing a given set

In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset.

Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with a history stretching back to antiquity.

Noncommutative geometry (NCG) is a branch of mathematics concerned with a geometric approach to noncommutative algebras, and with the construction of spaces that are locally presented by noncommutative algebras of functions. A noncommutative algebra is an associative algebra in which the multiplication is not commutative, that is, for which does not always equal ; or more generally an algebraic structure in which one of the principal binary operations is not commutative; one also allows additional structures, e.g. topology or norm, to be possibly carried by the noncommutative algebra of functions.

Discrete geometry Branch of geometry that studies combinatorial properties and constructive methods

Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object.

Geometric topology Branch of mathematics studying (smooth) functions of manifolds

In mathematics, geometric topology is the study of manifolds and maps between them, particularly embeddings of one manifold into another.

Algorithmic topology, or computational topology, is a subfield of topology with an overlap with areas of computer science, in particular, computational geometry and computational complexity theory.

Mathematics encompasses a growing variety and depth of subjects over its history, and comprehension of it requires a system to categorize and organize these various subjects into a more general areas of mathematics. A number of different classification schemes have arisen, and though they share some similarities, there are differences due in part to the different purposes they serve.

In applied mathematics, topological data analysis (TDA) is an approach to the analysis of datasets using techniques from topology. Extraction of information from datasets that are high-dimensional, incomplete and noisy is generally challenging. TDA provides a general framework to analyze such data in a manner that is insensitive to the particular metric chosen and provides dimensionality reduction and robustness to noise. Beyond this, it inherits functoriality, a fundamental concept of modern mathematics, from its topological nature, which allows it to adapt to new mathematical tools.

The mathematician Shmuel Aaron Weinberger is an American topologist. He completed a PhD in mathematics in 1982 at New York University under the direction of Sylvain Cappell. Weinberger was, from 1994 to 1996, the Thomas A. Scott Professor of Mathematics at the University of Pennsylvania, and he is currently the Andrew MacLeish Professor of Mathematics and chair of the Mathematics department at the University of Chicago.

James W. Cannon is an American mathematician working in the areas of low-dimensional topology and geometric group theory. He was an Orson Pratt Professor of Mathematics at Brigham Young University.

Polymake

Polymake is software for the algorithmic treatment of convex polyhedra.

The following outline is provided as an overview of and topical guide to formal science:

Jean-Daniel Boissonnat is a French computer scientist, who works as a director of research at the French Institute for Research in Computer Science and Automation (INRIA). He is an invited professor of computational geometry at the Collège de France, holding the Chair in Informatics and Computational Sciences for 2016–2017.

Mariette Yvinec is a French researcher in computational geometry at the French Institute for Research in Computer Science and Automation (INRIA) in Sophia Antipolis. She is one of the developers of CGAL, a software library of computational geometry algorithms.

Dan Burghelea is a Romanian-American mathematician, academic and researcher. He is an Emeritus Professor of Mathematics at Ohio State University.

References

  1. 1 2 3 4 5 Berg, Michael (April 2019), "Review of Geometric and Topological Inference", MAA Reviews, Mathematical Association of America
  2. 1 2 Rodrigues, Kévin Allan Sales, "Review of Geometric and Topological Inference", zbMATH , Zbl   1457.62006
  3. 1 2 3 Adams, Henry Hugh, "Review of Geometric and Topological Inference", MathSciNet , MR   3837127
  4. 1 2 3 4 5 Hunacek, Mark (February 2021), "Review of Geometric and Topological Inference", The Mathematical Gazette , 105 (562): 184–185, doi:10.1017/mag.2021.37
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.