How much of persistent homology is topology? A quantitative decomposition for spin model phase transitions
Matthew Loftus

TL;DR
This paper introduces a method to quantify the topological versus density-driven contributions in persistent homology signals from spin models, revealing that H_1 features contain genuine topological information relevant to phase transitions.
Contribution
The authors propose f_topo, a new metric to decompose PH signals, and demonstrate its effectiveness in distinguishing topological features from density effects in spin models.
Findings
H_0 statistics are mostly density-driven, with less than 7% topological contribution.
H_1 statistics show a growing topological component with system size, following finite-size scaling.
The longest persistence bar is strongly topological and scales with the correlation length.
Abstract
Point-cloud persistent homology (PH) -- computing alpha or Rips complexes on spin-position point clouds -- has been widely applied to detect phase transitions in classical spin models since Donato et al. (2016), with subsequent studies attributing the detection to the topological content of the persistence diagram. We ask a simple question that has not been posed: what fraction of the PH signal is genuinely topological? We introduce f_topo, a quantitative decomposition that separates the density-driven and topological contributions to any PH statistic by comparing real spin configurations against density-matched shuffled null models. Across the 2D Ising model (system sizes L = 16-128, ten temperatures) and Potts models (q = 3, 5), we find that H_0 statistics -- total persistence, persistence entropy, feature count -- are 94-100% density-driven (f_topo < 0.07). The density-matched…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
