Localized patterns and semi-strong interaction, a unifying framework for reaction–diffusion systems

Systems of activator–inhibitor reaction–diffusion equations posed on an infinite line are studied using a variety of analytical and numerical methods. A canonical form is considered, which contains all known models with simple cubic autocatalytic nonlinearity and arbitrary constant and linear kinetics. Restricting attention to models that have a unique homogeneous equilibrium, this class includes the classical Schnakenberg and Brusselator models, as well as other systems proposed in the literature to model morphogenesis. Such models are known to feature Turing instability, when activator diffuses more slowly than inhibitor, leading to stable spatially periodic patterns. Conversely in the limit of small feed rates, semi-strong interaction asymptotic analysis shows existence of isolated spike-like patterns. This paper describes the broad bifurcation structures that connect these two regimes. A certain universal two-parameter state diagram is revealed in which the Turing bifurcation becomes sub-critical, leading to the onset of homoclinic snaking. This regime then morphs into the spike regime, with the outer-fold being predicted by the semi-strong asymptotics. A rescaling of parameters and field concentrations shows how this state diagram can be studied independently of the diffusion rates. Temporal dynamics is found to strongly depend on the diffusion ratio though. A Hopf bifurcation occurs along the branch of stable spikes, which is subcritical for small diffusion ratio, leading to collapse to the homogeneous state. As the diffusion ratio increases, this bifurcation typically becomes supercritical and interacts with the homoclinic snaking and also with a supercritical homogeneous Hopf bifurcation, leading to complex spatio-temporal dynamics. The details are worked out for a number of different models that fit the theory using a mixture of weakly nonlinear analysis, semi-strong asymptotics and different numerical continuation algorithms.