Algorithmic Randomness in Continuous-Time Markov Chains

10/30/2019
by   Xiang Huang, et al.
0

In this paper we develop the elements of the theory of algorithmic randomness in continuous-time Markov chains (CTMCs). Our main contribution is a rigorous, useful notion of what it means for an individual trajectory of a CTMC to be random. CTMCs have discrete state spaces and operate in continuous time. This, together with the fact that trajectories may or may not halt, presents challenges not encountered in more conventional developments of algorithmic randomness. Although we formulate algorithmic randomness in the general context of CTMCs, we are primarily interested in the computational power of stochastic chemical reaction networks, which are special cases of CTMCs. This leads us to embrace situations in which the long-term behavior of a network depends essentially on its initial state and hence to eschew assumptions that are frequently made in Markov chain theory to avoid such dependencies. After defining the randomness of trajectories in terms of a new kind of martingale (algorithmic betting strategy), we prove equivalent characterizations in terms of constructive measure theory and Kolmogorov complexity. As a preliminary application we prove that, in any stochastic chemical reaction network, every random trajectory with bounded molecular counts has the non-Zeno property that infinitely many reactions do not occur in any finite interval of time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2022

Neural Continuous-Time Markov Models

Continuous-time Markov chains are used to model stochastic systems where...
research
02/14/2018

Molecular Computing for Markov Chains

In this paper, it is presented a methodology for implementing arbitraril...
research
07/31/2023

Stochastic Filtering of Reaction Networks Partially Observed in Time Snapshots

Stochastic reaction network models arise in intracellular chemical react...
research
07/02/2023

On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions

This paper studies the (discrete) chemical reaction network (CRN) comput...
research
03/06/2020

Generalized Parallel Tempering on Bayesian Inverse Problems

In the current work we present two generalizations of the Parallel Tempe...
research
01/30/2020

Automated Deep Abstractions for Stochastic Chemical Reaction Networks

Predicting stochastic cellular dynamics as emerging from the mechanistic...

Please sign up or login with your details

Forgot password? Click here to reset