Stochastic genetic networks with solvable structures
Journal Article
·
· AIP Conference Proceedings
- Department of Physics, University of Richmond, Richmond, Virginia 23173 (United States)
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.
- OSTI ID:
- 22390794
- Journal Information:
- AIP Conference Proceedings, Vol. 1637, Issue 1; Conference: ICNPAA 2014: 10. International Conference on Mathematical Problems in Engineering, Aerospace and Sciences, Narvik (Norway), 15-18 Jul 2014; Other Information: (c) 2014 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA); ISSN 0094-243X
- Country of Publication:
- United States
- Language:
- English
Similar Records
Predecessor and permutation existence problems for sequential dynamical systems
Predictability and reduced order modeling in stochastic reaction networks.
Non-polynomial extensions of solvable potentials à la Abraham-Moses
Conference
·
Tue Jan 01 00:00:00 EST 2002
·
OSTI ID:22390794
+2 more
Predictability and reduced order modeling in stochastic reaction networks.
Conference
·
Wed Oct 01 00:00:00 EDT 2008
·
OSTI ID:22390794
Non-polynomial extensions of solvable potentials à la Abraham-Moses
Journal Article
·
Tue Oct 15 00:00:00 EDT 2013
· Journal of Mathematical Physics
·
OSTI ID:22390794