Multistate nested canalizing functions and their networks

From MaRDI portal
Publication:528485

DOI10.1016/J.TCS.2017.01.031zbMATH Open1370.92049arXiv1411.4067OpenAlexW2963501037MaRDI QIDQ528485FDOQ528485

Reinhard Laubenbacher, Yuan Li, Jack Kuipers, J. O. Adeyeye, C. Kadelka

Publication date: 12 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: This paper provides a collection of mathematical and computational tools for the study of robustness in nonlinear gene regulatory networks, represented by time- and state-discrete dynamical systems taking on multiple states. The focus is on networks governed by nested canalizing functions (NCFs), first introduced in the Boolean context by S. Kauffman. After giving a general definition of NCFs we analyze the class of such functions. We derive a formula for the normalized average c-sensitivities of multistate NCFs, which enables the calculation of the Derrida plot, a popular measure of network stability. We also provide a unique canonical parametrized polynomial form of NCFs. This form has several consequences. We can easily generate NCFs for varying parameter choices, and derive a closed form formula for the number of such functions in a given number of variables, as well as an asymptotic formula. Finally, we compute the number of equivalence classes of NCFs under permutation of variables. Together, the results of the paper represent a useful mathematical framework for the study of NCFs and their dynamic networks.


Full work available at URL: https://arxiv.org/abs/1411.4067




Recommendations




Cites Work


Cited In (10)





This page was built for publication: Multistate nested canalizing functions and their networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528485)