Abstract
AbstractTransition graphs or transition diagrams, describing the rates and probabilities with which a system changes between discrete states, are common throughout the sciences. In many cases, parameterisations of transition graphs are inferred from different datasets, for example in the context of Markov or hidden Markov models. An important task for followup analysis is to find efficient and effective ways to compare transition graphs with different parameterisations. Here, we introduce the Weight-Filtration Comparison Curve (WFCC), an approach by which the differences between two or more parameterisations of a transition graph can be quantified and compared. Borrowing from topological data analysis, the WFCC allows graphs learned from different datasets and/or null models to be systematically compared, and differences in both the fine- and coarse-grained structure and dynamics of transition graphs to be quantitatively assessed. We demonstrate WFCC with simple illustrative cases and real-world cases of transition graphs inferred from global data on the evolution of antimicrobial resistance in different countries, showing how different inferred dynamics, and different levels of uncertainty, are reported by structural aspects of these comparison curves.
Publisher
Cold Spring Harbor Laboratory
Reference53 articles.
1. Adamaszek, M. and Adams, H. (2021). On Vietoris–Rips complexes of hypercube graphs.
2. Adams, H. , Shukla, S. , and Singh, A. (2022). Čech complexes of hypercube graphs.
3. Adams, H. and Virk, Ž. (2023). Lower bounds on the homology of Vietoris-Rips complexes of hypercube graphs.
4. Allen, L. J. (2010). An introduction to stochastic processes with applications to biology. CRC press.
5. Anderson, T. W. and Goodman, L. A. (1957). Statistical inference about Markov chains. The annals of mathematical statistics, pages 89–110.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献