Model comparison via simplicial complexes and persistent homology

@article{Vittadello2021ModelCV,
  title={Model comparison via simplicial complexes and persistent homology},
  author={Sean T. Vittadello and Michael P. H. Stumpf},
  journal={Royal Society Open Science},
  year={2021},
  volume={8}
}
In many scientific and technological contexts, we have only a poor understanding of the structure and details of appropriate mathematical models. We often, therefore, need to compare different models. With available data we can use formal statistical model selection to compare and contrast the ability of different mathematical models to describe such data. There is, however, a lack of rigorous methods to compare different models a priori. Here, we develop and illustrate two such approaches that… 

Figures and Tables from this paper

A group theoretic approach to model comparison with simplicial representations
TLDR
An automatable methodology for determining model equivalence using group actions on the simplicial complexes is developed, which greatly simplify and expedite the process of determiningmodel equivalence.
Algebra, Geometry and Topology of ERK Kinetics
TLDR
This work studies a polynomial dynamical system describing the dynamics of MEK/ERK with experimental setup, data and known biological information and demonstrates how methods from computational algebraic geometry, differential algebra, Bayesian statistics and computationalgebraic topology can inform the model reduction, identification and parameter inference of MeK variants.
Persistent homology and the shape of evolutionary games
  • Jakob Stenseke
  • Computer Science, Medicine
    Journal of theoretical biology
  • 2021
The Design Principles of Discrete Turing Patterning Systems.
TLDR
A large-scale study on all possible two-species networks is performed and it is found that Turing pattern topologies found to be substantially more robust to changes in the parameters of the model than in the continuous case.
Tree Edit Distance with Variables. Measuring the Similarity between Mathematical Formulas
In this article, we propose tree edit distance with variables, which is an extension of the tree edit distance to handle trees with variables and has a potential application to measuring the
Turing pattern design principles and their robustness
TLDR
A review of recent large-scale mathematical analyses that have attempted to narrow down potential design principles for Turing-patterning systems considers robustness in the context of developmental modelling more generally.
What are higher-order networks?
TLDR
The goals are to clarify (i) what higher-order networks are, (ii) why these are interesting objects of study, and (iii) how they can be used in applications.
The Design Principles of Discrete Turing Patterning Systems
TLDR
A large-scale study on all possible two-species networks is performed and finds the same Turing pattern producing networks as in the continuous framework, but these Turing pattern topologies are found to be substantially more robust to changes in the parameters of the model.

References

SHOWING 1-10 OF 92 REFERENCES
A numerical approach for the filtered generalized Cech complex
TLDR
An algorithm to compute the filtered generalized Cech complex for a finite collection of disks in the plane, which don't necessarily have the same radius, through a numerical approach whose convergence is guaranteed by a generalization of the well-known Vietoris-Rips Lemma.
BioModels—15 years of sharing computational models in life science
TLDR
BioModels has become the world’s largest repository of curated models and emerged as the third most used data resource after PubMed and Google Scholar among the scientists who use modelling in their research.
Mechanistic Modeling and Multiscale Applications for Precision Medicine: Theory and Practice
Drug research, therapy development, and other areas of pharmacology and medicine can benefit from simulations and optimization of mathematical models that contain a mathematical description of inte...
Multi-model and network inference based on ensemble estimates: avoiding the madness of crowds
  • M. Stumpf
  • Computer Science, Medicine
    Journal of the Royal Society Interface
  • 2020
TLDR
In the cases of model selection and network inference when the authors can trust ensembles, and when they should be cautious, the analyses suggest that the careful construction of an ensemble—choosing good predictors—is of paramount importance.
Multi-Model and Network Inference Based on Ensemble Estimates: Avoiding the Madness of Crowds
TLDR
The analyses suggests that the careful construction of an ensemble – choosing good predictors – is of paramount importance, more than had perhaps been realised before: merely adding different methods does not suffice.
Persistence homology of networks: methods and applications
TLDR
A conceptual review of key advancements in this area of using persistent homology on complex network science, focusing on recent approaches that get significant attention in the mathematics and data mining communities working on network data.
Persistent homology of unweighted complex networks via discrete Morse theory
TLDR
This work presents a new method based on discrete Morse theory to study topological properties of unweighted and undirected networks using persistent homology that achieves close to the theoretical minimum number of critical simplices in several analyzed model and real networks.
Positional information and tissue scaling during development and regeneration
ABSTRACT In order to contribute to the appropriate tissues during development, cells need to know their position within the embryo. This positional information is conveyed by gradients of signaling
...
1
2
3
4
5
...