Skip to main content Accessibility help
×
  • Cited by 47
Publisher:
Cambridge University Press
Online publication date:
February 2022
Print publication year:
2022
Online ISBN:
9781009099950

Book description

Topological data analysis (TDA) has emerged recently as a viable tool for analyzing complex data, and the area has grown substantially both in its methodologies and applicability. Providing a computational and algorithmic foundation for techniques in TDA, this comprehensive, self-contained text introduces students and researchers in mathematics and computer science to the current state of the field. The book features a description of mathematical objects and constructs behind recent advances, the algorithms involved, computational considerations, as well as examples of topological structures or ideas that can be used in applications. It provides a thorough treatment of persistent homology together with various extensions – like zigzag persistence and multiparameter persistence – and their applications to different types of data, like point clouds, triangulations, or graph data. Other important topics covered include discrete Morse theory, the Mapper structure, optimal generating cycles, as well as recent advances in embedding TDA within machine learning frameworks.

Reviews

'A must-have up-to-date computational account of a vibrant area connecting pure mathematics with applications.'

Herbert Edelsbrunner - IST Austria

'This book provides a comprehensive treatment of the algorithmic aspects of topological persistence theory, both in the classical one-parameter setting and in the emerging multi-parameter setting. It is an excellent resource for practitioners within or outside the field, who want to learn about the current state-of-the-art algorithms in topological data analysis.'

Steve Oudot - Inria and Ecole polytechnique

‘There are many things to appreciate about this book, including the abundance of excellent and helpful figures, the extensive reference list, and the variety of instructive exercises for students to work through … Thanks to its inclusion of so much cutting-edge recent work and state-of-the-art algorithms, this is an ideal book for mathematicians or computer scientists looking to dive into this exciting and still very young area of research.’

Ellen Gasparovic Source: Mathematical Association of America Reviews

‘This is a much needed update and contribution to the vast and rapidly growing area of computational topology. It will be the new go-to text for years to come.’

Nicholas A. Scoville

‘As a complete package, the book is an ideal text for a first course on topological data analysis for beginning graduate students … Highly recommended.’

M. Clay Source: Choice

‘The work under consideration provides a thorough and comprehensive introduction to computational topology. The book is largely self-contained and does not presuppose prior knowledge of topology.’

Walter D. Freyn Source: MathSciNet

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
×

Contents

  • 1 - Basics
    pp 1-25

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.