162 citations · 770 across the 73 of their papers we have counts for
5 papers · 1 filter
Optimal Kullback-Leibler Aggregation via Information Bottleneck
Bernhard C. Geiger, Tatjana Petrov, Gernot Kubin +1
In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of redu…
Markov chain aggregation and its applications to combinatorial reaction networks
Arnab Ganguly, Tatjana Petrov, Heinz Koeppl
We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for…
Under-approximating Cut Sets for Reachability in Large Scale Automata Networks
Loïc Paulevé, Geoffroy Andrieux, Heinz Koeppl
In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary…
Dynamical Properties of Discrete Reaction Networks
Loïc Paulevé, Gheorghe Craciun, Heinz Koeppl
Reaction networks are commonly used to model the evolution of populations of species subject to transformations following an imposed stoichiometry. This paper focuses on the effici…
Pooling single-cell recordings: Scalable inference through heterogeneous kinetics
Christoph Zechner, Michael Unger, Serge Pelet +2
Mathematical methods together with measurements of single-cell dynamics provide unprecedented means to reconstruct intracellular processes that are only partly or indirectly access…