Stochastic genetic networks with solvable structures

We describe a set of basic stochastic biocircuits for which the Master Equation is completely solvable. Beside linear circuits, which are known to be solvable, we show that tree-like circuits with polynomial transition functions are also completely solvable. We associate a simple but unambiguous gra...

Full description

Saved in:
Bibliographic Details
Main Author: Lipan, Ovidiu
Format: Conference Proceeding
Language:English
Subjects:
CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS
EQUATIONS
Functions (mathematics)
Graphical representations
Linear circuits
Mathematical analysis
MATHEMATICAL SOLUTIONS
POLYNOMIALS
SIGNALS
STOCHASTIC PROCESSES
TRANSFER FUNCTIONS
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We describe a set of basic stochastic biocircuits for which the Master Equation is completely solvable. Beside linear circuits, which are known to be solvable, we show that tree-like circuits with polynomial transition functions are also completely solvable. We associate a simple but unambiguous graphical representation to such circuits. The graphical representation shows the signal propagation through these simple circuits.
ISSN:0094-243X
1551-7616
DOI:10.1063/1.4904627