A Multiple Time-Step Finite State Projection Algorithm for the Solution to the Chemical Master Equation

Abstract

At the mesoscopic scale, chemical processes have probability distributions that evolve according to an infinite set of linear ordinary differential equations known as the chemical master equation (CME). It is commonly believed that the CME cannot be solved except for the most trivial of cases, but recent work has raised questions regarding validity of this belief. For many cases, Finite State Projection (FSP) techniques can reduce the order of the CME to a solvable system while retaining any prespecified error tolerance. Even when accuracy demands require a projection that is too large to be solved efficiently, the FSP retains the linearity of the CME, and is open to a host of additional model reductions and computational techniques. In this paper, we develop a new algorithm based upon the linearity property of super-positioning, and we illustrate the benefits of this algorithm on a simplified model of the heat shock mechanism in E. coli. The new algorithm retains the full accuracy of the original FSP algorithm, but with significantly increased efficiency and a greater range of applicability.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 30, 2006
Accession Number
ADA458809

Entities

People

  • Brian Munsky
  • Mustafa Khammash

Organizations

  • University of California, Santa Barbara

Tags

DTIC Thesaurus Topics

  • Accuracy
  • Algorithms
  • Chemical Reactions
  • Computational Biology
  • Computational Complexity
  • Computations
  • Differential Equations
  • Dynamics
  • Equations
  • Linear Systems
  • Linearity
  • Markov Processes
  • Probability
  • Probability Distributions
  • Simulations
  • Systems Biology
  • Time Intervals

Readers

  • Calculus or Mathematical Analysis
  • Economics
  • Reinforced Composite Materials