Markov chain aggregation and its applications to combinatorial reaction networks
From MaRDI portal
Publication:404799
DOI10.1007/s00285-013-0738-7zbMath1300.60089arXiv1303.4532OpenAlexW2057391600WikidataQ46969766 ScholiaQ46969766MaRDI QIDQ404799
Heinz Koeppl, Arnab Ganguly, Tatjana Petrov
Publication date: 4 September 2014
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.4532
Protein sequences, DNA sequences (92D20) Continuous-time Markov processes on discrete state spaces (60J27) Applications of continuous-time Markov processes on discrete state spaces (60J28)
Related Items
Estimation of cell lineage trees by maximum-likelihood phylogenetics, Model Decomposition and Stochastic Fragments, Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains, Approximate lumpability for Markovian agent-based models using local symmetries
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lumpability abstractions of rule-based systems
- A finite characterization of weak lumpable Markov processes. I: The discrete time case
- A finite characterization of weak lumpable Markov processes. II: The continuous time case
- Markov chains and invariant probabilities
- Formal molecular biology
- On weak lumpability of denumerable Markov chains
- Separation of time-scales and model reduction for stochastic reaction networks
- Bisimulation relations for weighted automata
- Markov property for a function of a Markov chain: A linear algebra approach
- Markov Chains
- Exact and ordinary lumpability in finite Markov chains
- Linear dynamics for the state vector of Markov chain functions
- Lumpability and Commutativity of Markov Processes