Compartmental modeling

Similar documents
Linear Compartmental Systems-The Basics

Noncompartmental vs. Compartmental Approaches to Pharmacokinetic Data Analysis Paolo Vicini, Ph.D. Pfizer Global Research and Development David M.

System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den

Outlines. Discrete Time Markov Chain (DTMC) Continuous Time Markov Chain (CTMC)

SMA 208: Ordinary differential equations I

Math 308, Sections 301, 302, Summer 2008 Review before Test I 06/09/2008

Noncompartmental vs. Compartmental Approaches to Pharmacokinetic Data Analysis Paolo Vicini, Ph.D. Pfizer Global Research and Development David M.

Stochastic modelling of epidemic spread

Stochastic modelling of epidemic spread

Compartmental Modelling: Eigenvalues, Traps and Nonlinear Models

MATH 56A: STOCHASTIC PROCESSES CHAPTER 0

Modelling in Systems Biology

Differential equations

Lecture Notes: Markov chains Tuesday, September 16 Dannie Durand

Modeling with First-Order Equations

Modeling with First-Order Equations

Markov Chains and MCMC

EC Control Engineering Quiz II IIT Madras

6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities

MCMC 2: Lecture 3 SIR models - more topics. Phil O Neill Theo Kypraios School of Mathematical Sciences University of Nottingham

Diagonalization of Matrices

CS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:

Irreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1

Modeling with differential equations

Structural identifiability of linear mamillary compartmental systems

Ordinary Differential Equations

Epidemics on networks

10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections )

C2 Differential Equations : Computational Modeling and Simulation Instructor: Linwei Wang

Differential Equations and Modeling

Calculus for the Life Sciences II Assignment 6 solutions. f(x, y) = 3π 3 cos 2x + 2 sin 3y

Models of Molecular Evolution

MA 1128: Lecture 08 03/02/2018. Linear Equations from Graphs And Linear Inequalities

The geometry of least squares

N1 Newton s Laws and N2 - Vector Calculus. General Physics Volume N 1

FIRST-ORDER ORDINARY DIFFERENTIAL EQUATIONS I: Introduction and Analytic Methods David Levermore Department of Mathematics University of Maryland

LAW OF LARGE NUMBERS FOR THE SIRS EPIDEMIC

LECTURE 4-1 INTRODUCTION TO ORDINARY DIFFERENTIAL EQUATIONS

Lecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.

Epidemics on networks

LIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE

MATH 2203 Exam 3 Version 2 Solutions Instructions mathematical correctness clarity of presentation complete sentences

Stochastic Shortest Path Problems

Three Disguises of 1 x = e λx

Math Ordinary Differential Equations

Math 216 Final Exam 14 December, 2012

Notes for Math 450 Stochastic Petri nets and reactions

JOINING AND DECOMPOSING REACTION NETWORKS. 1. Introduction

Class President: A Network Approach to Popularity. Due July 18, 2014

Algebraic Representation of Networks

Solutions to Math 53 Math 53 Practice Final

The death of an epidemic

Markov Chains. Arnoldo Frigessi Bernd Heidergott November 4, 2015

Math 392 Exam 1 Solutions Fall (10 pts) Find the general solution to the differential equation dy dt = 1

ORDINARY DIFFERENTIAL EQUATION: Introduction and First-Order Equations. David Levermore Department of Mathematics University of Maryland

Module 6 Note Taking Guide. Lesson 6.01:Organization of Life

Advanced Chemical Reaction Engineering Prof. H. S. Shankar Department of Chemical Engineering IIT Bombay. Lecture - 03 Design Equations-1

Machine Learning for Data Science (CS4786) Lecture 24

ORDINARY DIFFERENTIAL EQUATIONS: Introduction and First-Order Equations. David Levermore Department of Mathematics University of Maryland

No class on Thursday, October 1. No office hours on Tuesday, September 29 and Thursday, October 1.

Lecture Notes: Markov chains

VANDERBILT UNIVERSITY. MATH 2610 ORDINARY DIFFERENTIAL EQUATIONS Practice for test 1 solutions

Numerical solution of stochastic epidemiological models

1 of 10 2/7/ :49 AM

Systems of Linear ODEs

An Introduction to Xcos

Name: Block: Unit 2 Inequalities

MA 138 Calculus 2 for the Life Sciences Spring 2016 Final Exam May 4, Exam Scores. Question Score Total

Dynamical Systems. August 13, 2013

FIRST-ORDER SYSTEMS OF ORDINARY DIFFERENTIAL EQUATIONS III: Autonomous Planar Systems David Levermore Department of Mathematics University of Maryland

Day 1: Introduction to Vectors + Vector Arithmetic

Statistics 992 Continuous-time Markov Chains Spring 2004

The Leslie Matrix. The Leslie Matrix (/2)

Copyright is owned by the Author of the thesis. Permission is given for a copy to be downloaded by an individual for the purpose of research and

Worksheet 8 Sample Solutions

MATH 215/255 Solutions to Additional Practice Problems April dy dt

Stability Theory for Nonnegative and Compartmental Dynamical Systems with Time Delay

1 Counting spanning trees: A determinantal formula

AC&ST AUTOMATIC CONTROL AND SYSTEM THEORY SYSTEMS AND MODELS. Claudio Melchiorri

MULTIPLE EQUILIBRIA IN COMPLEX CHEMICAL REACTION NETWORKS: II. THE SPECIES-REACTION GRAPH

Markov Model. Model representing the different resident states of a system, and the transitions between the different states

Parameter Selection Techniques and Surrogate Models

Heat and Mass Transfer Prof. S.P. Sukhatme Department of Mechanical Engineering Indian Institute of Technology, Bombay

Chemical Reac+ons and Enzymes. Lesson Overview. Lesson Overview. 2.4 Chemical Reactions and Enzymes

MAA704, Perron-Frobenius theory and Markov chains.

Stochastic processes. MAS275 Probability Modelling. Introduction and Markov chains. Continuous time. Markov property

CSC 446 Notes: Lecture 13

= first derivative evaluated at that point: ( )

ECS 289 F / MAE 298, Lecture 15 May 20, Diffusion, Cascades and Influence

Applied Calculus. Review Problems for the Final Exam

Thursday. Threshold and Sensitivity Analysis

Statistical Experiment A statistical experiment is any process by which measurements are obtained.

Exercises Evaporation (page 451) 23.2 Condensation (pages )

Old Math 330 Exams. David M. McClendon. Department of Mathematics Ferris State University

The SIR Disease Model Trajectories and MatLab

Network Analysis of Biochemical Reactions in Complex Environments

Electromagnetic Theory Prof. D. K. Ghosh Department of Physics Indian Institute of Technology, Bombay

Stochastic process. X, a series of random variables indexed by t

VANDERBILT UNIVERSITY MAT 155B, FALL 12 SOLUTIONS TO THE PRACTICE FINAL.

Topic 3 Notes Jeremy Orloff

Transcription:

Compartmental modeling This is a very short summary of the notes from my two-hour lecture. These notes were not originally meant to be distributed, and so they are far from being complete. A comprehensive introduction to compartmental modeling can be found for example in the book Compartmental Analysis in Biology and Medicine by J. A. Jacquez (Elsevier, Amsterdam, 1972). Bernt Wennberg The basic definition and a couple of examples Definition: A compartment is a kinetically homogeneous amount of some material. Example: The basic model is a well-stirred tank of volume V with an influx q in and out-flux q ut as in figure 1; then the right half of the same figure shows a graphical abstraction, the pictorial idea of a compartment. Figure 1: A compartmental model Example: One of the most important applications of compartmental modeling is in pharmaco kinetics. Figure 2 shows a typical example, where the body is modeled with two compartments: one for the blood and one for all tissue in the body. The drug enters the blood either intravenously or orally, and is then transfered from the blood to the remaining part of the body, and reversely, or somehow leaves the body. Figure 2: A pharmaco kinetic model 1

Example: Figure 3 shows a less typical example. We consider a chemical reaction: A + B v 1 AB v2 The concentrations are denoted x 1 = [A] x 2 = [B] x 3 = [AB] Figure 3: A compartmental model for the element A in a chemical reaction and typically the reaction rates are given by v 1 = k 1 x 1 x 2 v 2 = k 2 x 3 Representations of compartmental models The representation of a compartmental model as a collection of boxes (or circles) and arrows may be called a connectivity diagram. An alternative is to use a directed graph, as in figure 3. The arrows are then the directed edges, which connect the nodes. Figure 4: A compartmental model represented by a connectivity diagram (left) and a directed graph (right) Some vocabulary: A directed graph is complete if all pairs of nodes, x i, x j are connected in at least one direction, i.e. either x i x j or x j x i. A directed graph is symmetric if whenever there is an edge x i x j, there is also the edge x j x i. A path from node x i to node x j is a sequence of edges x i x k1 x kn x j A node x i is reachable from x j if there is a path from x i to x j. A graph is strongly connected if for any pair of nodes x i, x j, there is a path from x i to x j. 2

Example: The following graph (figure 5) is not strongly connected. However, the subgraphs which consist of the encircled nodes and edges are. These subgraphs are called the strong components of the graph. Sometimes it is useful to consider a simplified graph that is obtained by replacing the strong components by a single node. This is called condensation by strong components, and is illustrated in the figure. Figure 5: A directed graph which is connected but not strongly connected. The strong components are indicated by circles. The adjacency matrix and the reachability matrix Consider the following graph: Figure 6: A directed graph with five nodes For a graph with N nodes, x 1,..., x N, the adjacency matrix is a matrix A = {a ij } with 0 on the diagonal, and the entry a ij = 1 if there is an edge from x i to x j and a ij = 0 otherwise. The reachability matrix is a matrix R = {r ij } with 1 on the diagonal, and the entry r ij = 1 if there is a path from x i to x j and a ij = 0 otherwise. For the example in figure 6 we have One can show that A = 0 1 1 0 0 1 0 1 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 1 0 and R = R = I + A + A 2 +... + A N 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 0 0 1 1 1 0 0 1 1 1 3

Two special types of compartmental models Figure 7: A catenary compartmental model Figure 8: A mamillary compartmental model A catenary system is one where all compartments are connected in a chain, with only one input compartment and one output compartment. A mamillary system is one which has one central compartment, that may have an input and an output, and a number of compartments that are connected only to the central compartment. Some more definitions An outflow corresponds to a compartment with which has an arrow leaving the system. In a graph representation, one usually adds a node that corresponds to the outside. A compartmental system is outflow connected if from every compartment (node) there is a path to a compartment with an outflow. A compartment A is structurally influenced by a compartment C if it can reached from C (see figure 9). 4

A compartment B may be rate influenced by a compartment C if the a transfer rate v BA depends on the content of compartment C. Figure 9: Structural influence and rate influence A subsystem that is outflow closed, i.e., there is no path leading to a compartment that has an outflow, is called a trap. If a trap does not contain any traps in itself, it is called a simple trap The differential equation The rate of transfer into and out from a compartment are usually defined as in figure 10 below. This means that The rate of input into compartment number i is denoted I i. The rate of outflow from a compartment to the outside of the compartmental system is denoted F 0i. The sum of all outflows is often called clearance. The rate of flow from compartment i to compartment j is denoted F ji. N.B. The order of the indices is opposite to the one often used to describe a Markov chain! The units used to define the transfer rates should be amount of material / unit of time, and typically these rates depend on both the concentration and on time. In particular the transfer rates from a compartment is usually described in terms of the fractional transfer rate, which gives the fraction of the material contained in compartment i that leaves the compartment in a unit of time. The unit is then time 1. 5

Figure 10: Rates of input to and output from compartment i If we write q i for the amount of material in compartment i f ji the fractional transfer rate from compartment i to j we may write a system of differential equation for the amount of material in each compartment: q i = ij F ji ) + I i F 0i i j(f = i j(f ij q j f ji )q i + I i f 0i q i The system is said to be linear if the fractional transfer rates and the input rates are independent of the q j. To simplify notation, we may write q 1 f 11 f 12 f 1N q 2 f 21 f 22 f 2N q =. q N where the diagonal elements are defined as The system of differential equations is then and f = f ii = f 0i i... f N1 f N2 f NN dq = fq + I. (1) The matrix f and the vector I may in general depend on both q and t, and often also on a set of parameters: f = f(t, q, p) I = I(t, q, p) f ji., The coefficients of f satisfy 1. f ij 0 for i j. 2. f ii j i f ji Any matrix satisfying these to criteria is called a compartmental matrix, and a differential equation as in equation (1) is called a compartmental system 6

Two examples Infectious diseases Here we consider a population consisting of individuals that are either susceptible to be infected, infected (in this case, that are sick, it may happen that individuals carry an infection, and may infect others without being sick themselves), and finally, individuals who have recovered from the infection, but are immune. Denoting these different categories by X, Y and Z, we may draw the following compartmental model: Figure 11: A model for an infectious disease Here u denotes the rate of (non-infected) individuals entering the population, and α, β and γ denote the fractional transfer coefficients. By µ we mean the mortality rate; in this case susceptible and infected individuals have the same mortality rate, which may not be realistic, at least for dangerous infections. It is reasonable to assume that the infection rate is proportional to the fraction of infected individuals, so β = λy x + y + z The dynamics of this particular disease can then be expressed by a system of three coupled differential equations: dx dy dz λy = u µx x + y + z x + αz λy = x γy λy x + y + z = γy αz You should check for yourself that this is indeed a compartmental system. An enzyme reaction This is a typical reaction that involves a substrate S, a product P, the enzyme E that catalyses the reaction, and the intermediary complex ES. The reaction can be written S + E k 1 AB k 3 P + E k2 We denote the concentrations of the different substances as follows: x 1 = [S] y 1 = [E] x 3 = [ ] [S ES k4 x 2 = [S] y 2 = [ES] 7

where x 3 is the concentration of S bound in the complex with the enzyme. The total amounts of the substances is obtained by multiplying the concentrations by the volume V: q 1 = x 1 V, q 2 = x 2 V, q 3 = x 3 V q 4 = y 1 V, q 5 = y 2 V. Here it is natural to consider a compartment system as illustrated in figure 12 Figure 12: A compartmental model for an enzyme reaction Of course the different concentrations are not independent, and the system can be fully described by a system of three ordinary differential equations: dx 1 dx 2 dy 2 = k 1 y 1 x 1 + k 2 y 2 = k 3 y 2 x 1 k 4 y 1 x 2 = k 1 x 1 y 1 (k 2 + k 3 )y 2 + k 4 x 2 y 1 Tracer experiments The last couple of pages concern the possibility of determining the state of the system by experiment. The model is again the well stirred tank, and we suppose that it is in a stationary state, which means that the in and out flows as well as the quantity kept in the tank are constant. If it is not possible to directly measure the flux rates, is it possible to design an experiment to find the values anyway? A very common procedure is by the introduction of a tracer. In the tank we can think of introducing a small quantity of a different substance X into the tank. As the content of the tank is replaced, the concentration of the added substance will decrease, and by measuring its concentration in the tank, it is in fact possible to determine both the volume V and the fluxes. Figure 13 illustrates the situation. We denote the concentration [X] by Q(t), so that Q(t) = X(t)/V. Then the initial concentration Q(0) = X(0)/V, and if we assume that we know the quantity X(0) of substance that was injected into the tank, we can already compute V. In practice one measures a time series of concentrations, according to figure 14. The measured data should now be compared with the theoretical concentrations for a given set of parameters. The total amount of substance in the thank is described by dx(t) = Q(t)q 2 = q 2 V X(t) 8

Figure 13: A tracer experiment for a well-stirred tank Figure 14: Measurements for the tracer experiment. and dividing by V gives the same equation for the concentration, which then evolves according to Q(t) = Q(0)e q 2 V t. In figure 14 both the theoretical curve and the experimental data are plotted. The most common way of estimating the parameters is by minimizing S(V, q 2 ) = ( Q 1 Q(t 1 )) 2 σ 2 1 + ( Q 2 Q(t 2 )) 2 σ 2 2 +... + ( Q N Q(t N )) 2 σ 2 N (in the figure, there are N = 4 measurements). The σ 2 i describe the size of the errors in measurements. If the errors are normally distributed, and the σ 2 i are estimators of the variance in the errors, then minimizing S(V, q 2 ) is equivalent to finding V and q 2 by the principle of maximum likelihood. 9