Decomposing the parameter space of biological networks via a numerical discriminant approach

Author: 

Harrington, H
Mehta, D
Byrne, H
Hauenstein, J

Publication Date: 

28 February 2020

Journal: 

MC 2019: Maple in Mathematics Education and Research

Last Updated: 

2020-11-08T13:46:44.087+00:00

DOI: 

10.1007/978-3-030-41258-6_9

page: 

114-131

abstract: 

Many systems in biology (as well as other physical and engineering systems) can be described by systems of ordinary differential equation containing large numbers of parameters. When studying the dynamic behavior of these large, nonlinear systems, it is useful to identify and characterize the steady-state solutions as the model parameters vary, a technically challenging problem in a high-dimensional parameter landscape. Rather than simply determining the number and stability of steady-states at distinct points in parameter space, we decompose the parameter space into finitely many regions, the number and structure of the steady-state solutions being consistent within each distinct region. From a computational algebraic viewpoint, the boundary of these regions is contained in the discriminant locus. We develop global and local numerical algorithms for constructing the discriminant locus and classifying the parameter landscape. We showcase our numerical approaches by applying them to molecular and cell-network models.

Symplectic id: 

1061282

Submitted to ORA: 

Submitted

Publication Type: 

Conference Paper

ISBN-13: 

978-3-030-41257-9