The authors introduce a topological approach to analyzing Dynamic Bayesian Networks (DBNs) by converting them into time-varying graphs where edge strength measures variation in conditional dependence across parent configurations. Applying persistent homology to these graphs produces a "barcode" summarizing how groups of strongly dependent variables merge and disappear over time, and they prove this barcode is stable (robust to small perturbations in the conditional probability tables).
Main takeaways:
- Standard DBN inference focuses on local conditional distributions and can miss large-scale patterns in dependency structure.
- They assign each edge a strength measuring conditional dependence variation, retaining strong edges above a threshold.
- Persistent homology produces a barcode recording when connected groups of strongly dependent variables merge or disappear.
- The barcode is stable: small perturbations in the DBN's conditional probability tables lead to small barcode changes.
- Provides a noise-resistant summary of evolving dependency structure in dynamic Bayesian networks.