Model Rejection and Parameter Reduction via Time Series
From MaRDI portal
Publication:3176274
DOI10.1137/17M1134548zbMath1393.37092arXiv1706.04234OpenAlexW2962959015WikidataQ91427058 ScholiaQ91427058MaRDI QIDQ3176274
Bree Cummins, Shaun Harker, Tomáš Gedeon, Konstantin Mischaikow
Publication date: 19 July 2018
Published in: SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.04234
Graph theory (including graph drawing) in computer science (68R10) Dynamical systems in biology (37N25) Time series analysis of dynamical systems (37M10) Dynamical systems in numerical analysis (37N30)
Related Items
Model Rejection and Parameter Reduction via Time Series, Modeling transport regulation in gene regulatory networks, Oscillator death in coupled biochemical oscillators, A yeast cell cycle pulse generator model shows consistency with multiple oscillatory and checkpoint mutant datasets, Extremal event graphs: a (stable) tool for analyzing noisy time series data, Comparison of Combinatorial Signatures of Global Network Dynamics Generated by Two Classes of ODE Models, Using extremal events to characterize noisy time series, Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints
Uses Software
Cites Work
- Unnamed Item
- Stable oscillations in mathematical models of biological control systems
- Explicit construction of chaotic attractors in Glass networks
- Incidence matrices and interval graphs
- Periodic solutions of gene networks with steep sigmoidal regulatory functions
- Combinatorial-topological framework for the analysis of global dynamics
- Model Rejection and Parameter Reduction via Time Series
- Algorithmic Aspects of Vertex Elimination on Graphs
- A class of piecewise linear differential equations arising in biological models
- A Database Schema for the Analysis of Global Dynamics of Multiparameter Systems
- Combinatorial Representation of Parameter Space for Switching Networks
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Analysis of continuous-time switching networks