On Structural Contraction of Biological Interaction Networks

Biological networks are customarily described as structurally robust. This means that they often function extremely well under large forms of perturbations affecting both the concentrations and the kinetic parameters. In order to explain this property, various mathematical notions have been proposed in the literature. In this paper, we propose the notion of structural contractivity, building on the previous work of the authors. That previous work characterized the long-term dynamics of classes of biological interaction networks, based on “rate-dependent Lyapunov functions.” Here, we show that stronger notions of convergence can be established by proving structural contractivity with respect to nonstandard polyhedral [Formula: see text]-norms. In particular, we show that such networks are nonexpansive. With additional verifiable conditions, we show that they are strictly contractive over arbitrary positive compact sets. In addition, we show that such networks entrain to periodic inputs. We illustrate our theory with examples drawn from the modeling of intracellular signaling pathways.