Robustness of Turing models and gene regulatory networks with a sweet spot

Abstract

Traditional linear stability analysis based on matrix diagonalization is a computationally intensive process for high-dimensional systems of differential equations, posing substantial limitations for the exploration of Turing systems of pattern formation where an additional wave-number parameter needs to be investigated. In this paper, we introduce an efficient and intuitive technique that leverages Gershgorin's theorem to determine upper limits on regions of parameter space and the wave number beyond which Turing instabilities cannot occur. This method offers a streamlined avenue for exploring the phase diagrams of other complex multi-parametric models, such as those found in gene regulatory networks in systems biology. Due to its suitability for the asymptotic limit of infinitely large systems, it predicts the existence of a sweet spot in network size for maximal Jacobian stability. Published by the American Physical Society 2024