2025 CMS Winter Meeting

Toronto, Dec 5 - 8, 2025

Abstracts        

Coxeter-James Prize

CHRIS KAPULKIN, University of Western Ontario
Topology, graphs, and data  [PDF]

Discrete homotopy theory is an emerging area of mathematics that applies topological intuitions in discrete settings. It associates (discrete) homotopy and homology groups to graphs that detect combinatorial, rather than topological, "holes." It has found numerous applications, including to matroid theory, hyperplane arrangements, and network analysis.

This talk will be an introduction to discrete homotopy theory, building towards two main contributions. The first is a theoretical result, joint with Daniel Carranza (Compos. Math. 2024), that associates to a graph a topological space whose homotopy and homology groups recover the discrete homotopy and homology groups of the graph. The second, joint with Nathan Kershaw (arXiv:2506.15020), is an application of the foregoing result to data analysis, showing that persistent discrete homology provides an alternative to standard techniques of topological data analysis that is better suited for noisy data.

No background in homotopy theory, combinatorics, or statistics will be assumed.


© Canadian Mathematical Society : http://www.cms.math.ca/