ece598/math595: Topological Data Analysis

goals

This course provides a rigorous, ground-up foundation in Topological Data Analysis (TDA). It will cover elementary tools from algebraic topology, move through Morse theory and its more precise embodiment as persistent homology, and connect the resulting techniques with with spatial data, Gaussian Random Fields (GRFs), and robust feature extraction.

prerequisites

Good working knowledge of linear algebra (Math 257, 416…) and basic ideas of analysis (Math 424, 432, 444, 447…) should suffice. If in doubt, contact the instructor.

logistics

Lectures 4-5:20 pm MW in ECEB3015.
Office hours by zoom, Tu 9:30-10:30am or by appointment.
Recordings are in the course channel.

course schedule

DateWеекTopic
08/241Introduction; Course overview.
Definition of a topological space. Open and closed sets, bases. Key topological properties: compactness and connectedness. Metric spaces: basic properties, examples. Gromov–Hausdorff distance between metric spaces. Ultrametric spaces and metric trees.
08/261Applications: Kleinberg and Carlsson-Memoli theorems. week 1, notes
Literature:
Kleinberg, An Impossibility Theorem for Clustering, NeurIPS, (2002).
Carlsson, Mémoli. Classifying clustering schemes. Foundations of Computational Mathematics 13.2 (2013): 221- 252.
08/312Negative curvature of Google maps.
Literature:
Baryshnikov, Ghrist, Negative curvature of Google maps, Math. Intelligencer. (2023)
Dimension: Lebesgue, Hausdorff, Box.
09/022Application: Space fillings curves (surfaces,…).
Manifolds. week 2, notes
No lecture — Labor Day (09/07)
09/093Bertini-Sard theorem and transversality. Embeddings. Applications: Whitney theorem. Takens’ embedding.
week 3, notes
09/144 Abstract and geometric simplicial complexes. Homotopy, homotopy equivalence, contractibility.
Homework 1 published. To be presented on 9.23 (3-4:30pm) or 9.26 (9-10am).
09/164Actionable Homotopy Results: Nerve theorem. Applications: spaces of preferences in social choice theory.
week 4, notes
09/215Dowker theorem.
Constructing simplicial complexes from point clouds.
Vietoris-Rips, Čech , alpha-complexes.
09/235Applications: Niyogi-Smale-Weinberger.
Hausmann-Letscher. Simplicial homology
09/286Simplicial homology, examples. Cellular homologies
09/306Euler characteristics. week 6, notes
10/057Applications: integration with respect to Euler characteristics, target counting.
Persistence. Filtered Spaces.
10/077Fundamental lemma, algorithms, structure theorem.
week 7, notes.
Homework 2, published
10/128Persistence diagrams and barcodes.
Persistence and merge trees. Merge tree monoid. Persistence Künneth theorem.
10/148Stability of Persistence Diagrams.
week 8, notes.
10/199Applications: multi-scale analysis for point clouds. Jitter in persistence diagrams.
10/219Homological dimension.
Elements of Morse theory.
week 9, notes.
10/2610Morse Complexes.
Applications in Statistics.
10/2810Stochastic Topology: Point Processes.
Random geometric simplicial complexes.
Classical connectivity results.
week 10, notes.
11/0211Topology of Random Geometric Complexes. Three regimes
Homework 3 published
11/0411Phase transitions for Betti numbers. Spaces of coverings
11/0912Topology of large random graphs (Erdös-Rènyi model)
11/1112Three regimes, emergence of giant component.
11/1613Topology of trajectories of Brownian motions and Brownian sheets
11/1813General theory of Gaussian fields on metric spaces.
Fall Break (11/21 – 11/29)
11/3014
12/0214
12/0715Project presentations

literature

  • Munkres, J. R. (2000). Topology (2nd Edition). Prentice Hall.
  • Hatcher, A. (2002). Algebraic Topology. Cambridge University Press.
  • Edelsbrunner, H., & Harer, J. (2010). Computational Topology: An Introduction. American Mathematical Society.
  • Adler, R. J., & Taylor, J. E. (2007). Random Fields and Geometry. Springer Monographs in Mathematics.

Relevant papers are cited in the notes.

evaluation

Homework assignments (3, at 16.6% each) and a final project (50.2%).
Final project will focus on working on a dataset, finding and interpreting its topological invariants.
Projects can be one of those here, or proposed by the students. Groups (of at most 3) are welcome.

Homework should be presented within 10 days of its announcement, during a zoom or in person meeting.