Stochastic model simulation using Kronecker product analysis and Zassenhaus formula approximation.

Area of Science:

• Computational Biology
• Systems Biology
• Biophysics

Background:

• Genetic regulatory networks exhibit stochastic behavior in biological entity generation (mRNA, proteins).
• Existing models like Stochastic Master Equations (SMEs) are detailed but computationally expensive.
• Probabilistic Boolean Networks offer lower complexity but coarser stochastic property capture.

Purpose of the Study:

• To develop a novel approximation of the Stochastic Master Equation (SME) model.
• To achieve lower computational complexity while retaining fine-scale stochastic details.
• To accurately model system behaviors like bistabilities and oscillations.

Main Methods:

• System representation using tensors and sparse connectivity exploitation.
• Approximation based on the Zassenhaus formula for matrix exponentiation.
• Derivation of upper bounds on expected error compared to SME.

Main Results:

• The proposed model demonstrates performance comparable to detailed SMEs.
• Achieves significantly lower computational complexity than SMEs.
• Shows reduced complexity compared to the Stochastic Simulation Algorithm (SSA) for equivalent accuracy.

Conclusions:

• The new tensor-based approximation offers an efficient alternative for modeling genetic regulatory network stochasticity.
• Accurately captures fine system details with reduced computational burden.
• Provides a practical approach for complex biological system analysis.