Optimal network sizes for most robust Turing patterns.
Ontology highlight
ABSTRACT: Many cellular patterns exhibit a reaction-diffusion component, suggesting that Turing instability may contribute to pattern formation. However, biological gene-regulatory pathways are more complex than simple Turing activator-inhibitor models and generally do not require fine-tuning of parameters as dictated by the Turing conditions. To address these issues, we employ random matrix theory to analyze the Jacobian matrices of larger networks with robust statistical properties. Our analysis reveals that Turing patterns are more likely to occur by chance than previously thought and that the most robust Turing networks have an optimal size, consisting of only a handful of molecular species, thus significantly increasing their identifiability in biological systems. Broadly speaking, this optimal
SUBMITTER: Shaberi HSA
PROVIDER: S-EPMC11757753 | biostudies-literature | 2025 Jan
REPOSITORIES: biostudies-literature
ACCESS DATA