Related papers: Reviving the Two-state Markov Chain Approach (Tech…
Continuous-time Markov chains are used to model stochastic systems where transitions can occur at irregular times, e.g., birth-death processes, chemical reaction networks, population dynamics, and gene regulatory networks. We develop a…
We propose a Dynamical Boolean Network (DBN), which is a Virtual Boolean Network (VBN) whose set of states is fixed but whose transition matrix can change from one discrete time step to another. The transition matrix $T_{k}$ of our DBN for…
The field of chemical computation attempts to model computational behavior that arises when molecules, typically nucleic acids, are mixed together. Thermodynamic binding networks (TBNs) is a highly abstracted model that focuses on which…
Many studies involving large Markov chains require determining a smaller representative (aggregated) chains. Each {\em superstate} in the representative chain represents a {\em group of related} states in the original Markov chain.…
The Michaelis-Menten enzymatic reaction is sufficient to perceive many subtleties of network modeling, including the concentration and time scales separations, the formal equivalence between bulk phase and single-molecule approaches, or the…
Model reduction of Markov processes is a basic problem in modeling state-transition systems. Motivated by the state aggregation approach rooted in control theory, we study the statistical state compression of a discrete-state Markov chain…
Markov Chains with variable length are useful stochastic models for data compression that avoid the curse of dimensionality faced by that full Markov Chains. In this paper we introduce a Variable Length Markov Chain whose transition…
Networks serve as a tool used to examine the large-scale connectivity patterns in complex systems. Modelling their generative mechanism nonparametrically is often based on step-functions, such as the stochastic block models. These models…
We present an efficient exact algorithm for estimating state sequences from outputs (or observations) in imprecise hidden Markov models (iHMM), where both the uncertainty linking one state to the next, and that linking a state to its…
Recent advances in deep learning frameworks have established valuable tools for analyzing the long-timescale behavior of complex systems such as proteins. Especially the inclusion of physical constraints, e.g. time-reversibility, was a…
Fluctuating environments pose tremendous challenges to bacterial populations. It is observed in numerous bacterial species that individual cells can stochastically switch among multiple phenotypes for the population to survive in rapidly…
Discrete-state stochastic models are a popular approach to describe the inherent stochasticity of gene expression in single cells. The analysis of such models is hindered by the fact that the underlying discrete state space is extremely…
Stochastic Chemical Reaction Networks are continuous time Markov chain models that describe the time evolution of the molecular counts of species interacting stochastically via discrete reactions. Such models are ubiquitous in systems and…
We apply a Bayesian data analysis scheme known as the Markov Chain Monte Carlo (MCMC) to the tomographic reconstruction of quantum states. This method yields a vector, known as the Markov chain, which contains the full statistical…
Undirected graphical models known as Markov networks are popular for a wide variety of applications ranging from statistical physics to computational biology. Traditionally, learning of the network structure has been done under the…
We study the problem of learning the Markov order in categorical sequences that represent paths in a network, i.e. sequences of variable lengths where transitions between states are constrained to a known graph. Such data pose challenges…
We study the stochastic dynamics of a system of interacting species in a stochastic environment by means of a continuous-time Markov chain with transition rates depending on the state of the environment. Models of gene regulation in systems…
The paper deals with non-linear Poisson neuron network models with bounded memory dynamics, that can include both Hebbian learning mechanisms and refractory periods. The state of a network is described by the times elapsed since its neurons…
The analysis of parametrised systems is a growing field in verification, but the analysis of parametrised probabilistic systems is still in its infancy. This is partly because it is much harder: while there are beautiful cut-off results for…
Verification of infinite-state Markov chains is still a challenge despite several fruitful numerical or statistical approaches. For decisive Markov chains, there is a simple numerical algorithm that frames the reachability probability as…