Lattice structures that parameterize regulatory network dynamics

Abstract

We consider two types of models of regulatory network dynamics: Boolean maps and systems of switching ordinary differential equations. Our goal is to construct all models in each category that are compatible with the directed signed graph that describe the network interactions. This leads to consideration of lattice of monotone Boolean functions (MBF), poset of non-degenerate MBFs, and a lattice of chains in these sets. We describe explicit inductive construction of these posets where the induction is on the number of inputs in MBF.

Our results allow enumeration of potential dynamic behavior of the network for both model types, subject to practical limitation imposed by the size of the lattice of MBFs described by the Dedekind number.