Search arXivSearch

arXiv · 2211.14649

Average sensitivity of nested canalizing multivalued functions

Abstract

The canalizing properties of biological functions have been mainly studied in the context of Boolean modelling of gene regulatory networks. An important mathematical consequence of canalization is a low average sensitivity, which ensures in particular the expected robustness to noise. In certain situations, the Boolean description is too crude, and it may be necessary to consider functions involving more than two levels of expression. We investigate here the properties of nested canalization for these multivalued functions. We prove that the average sensitivity of nested canalizing multivalued functions is bounded above by a constant. In doing so, we introduce a generalization of nested canalizing multivalued functions, which we call weakly nested canalizing, for which this upper bound holds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Élisabeth Remy, Paul Ruet. 2023-07-01. Average sensitivity of nested canalizing multivalued functions. https://arxiv.org/abs/2211.14649

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO