Skip to main content
Fundamental Research logoLink to Fundamental Research
. 2025 Oct 27;6(4):2137–2148. doi: 10.1016/j.fmre.2025.10.006

Solution landscape of reaction-diffusion systems reveals a nonlinear mechanism and spatial robustness of pattern formation

Shuonan Wu a, Bing Yu a, Yuhai Tu b,⁎, Lei Zhang c,⁎
PMCID: PMC13424414  PMID: 42539688

Highlights

  • •

    We propose a generic and efficient numerical algorithm to systematically construct the complete solution landscape of reaction-diffusion systems.

  • •

    We demonstrate that Turing instability is not the prerequisite to generate stable spatial patterns, uncovering a generic nonlinear mechanism that is beyond the original Turing mechanism.

  • •

    We elucidate the underlying mechanism for the robust positioning of spatial patterns in a reversible three-species RD system with intrinsic noise.

Keywords: Turing pattern, Pattern formation, Turing instability, Solution landscape, Saddle dynamics, Robust positioning

Graphical abstract

graphic file with name ga1.jpg

Abstract

Spontaneous pattern formation in homogeneous systems is ubiquitous in nature. Although Turing demonstrated that spatial patterns can emerge in reaction-diffusion (RD) systems when the homogeneous state becomes linearly unstable, it remains unclear whether Turing mechanism is the only route for pattern formation. Here, we develop an efficient algorithm to systematically construct the solution landscape to find all steady-state solutions connected to a homogeneous state. By applying our method to generic RD models, we find that stable spatial patterns can emerge via saddle-node bifurcations before the onset of Turing instability, and reveal a general nonlinear mechanism that increases the parameter space over which pattern formation occurs in the RD systems. Furthermore, by using a generalized action in the functional space based on large deviation theory, our method is extended to evaluate stability of spatial patterns against noise. Applying this general approach in a three-species RD model, we show that though formation of Turing patterns only requires two chemical species, the third species is critical for stabilizing patterns against strong intrinsic noise in small biochemical systems.

1. Introduction

Alan Turing, in his seminal study on morphogenesis [1], suggested that biological pattern formation can be understood by reaction-diffusion (RD) dynamics [2], [3], [4]. In the simplest scenario, nonlinear chemical reactions between two diffusive chemical species, a short-range activator and a long-range inhibitor (as illustrated in Fig. 1a), can spontaneously generate spatial patterns, so-called Turing patterns [5], [6], [7], [8]. As shown in Fig. 1b, the homogeneous (H) state with spatially uniform concentrations becomes linearly unstable against small perturbations when the reaction rates and diffusion constants satisfy certain conditions. This linear instability leads to spatial patterns that break the spatial translational symmetry of the underlying dynamics. Such mechanism is often called “Turing instability” or “diffusion-driven instability” [3], [9].

Fig. 1.

Fig. 1 dummy alt text

(a) Illustration of a two-species RD system for Turing pattern. (b) Turing instability indicates small perturbation of an unstable homogeneous state can generate stable inhomogeneous patterns. But, before Turing instability occurs, can large perturbation of a stable homogeneous state develop stable spatial patterns? (c) One-dimensional example of pattern transition under noise.

Many biological and physical systems can be described by RD models, for example, neuronal interactions of ocular dominance stripe formation [10], waves on the skin of the marine angelfish Pomacanthus [11], frequency-locking phenomena in a rotating spiral wave with external periodic forcing [12], interactions between zebrafish pigment cells [13], trans-membrane signal transduction [14], mussel population density patterns [15], etc.

Turing instability has long been regarded as the prototype mechanism for pattern formation in homogeneous RD systems [3]. Most theoretical studies on Turing patterns rely on linear stability analysis of the H state [16], [17] and its excitable wave numbers to establish general conditions for Turing instability. However, there are systems that can develop stable spatial patterns independent of the Turing instability [18], [19], [20], e.g., cell polarization responsible for cellular sensing and responsiveness [21], [22]. In these cases, stable patterns are not originated from small perturbations of the H state. However, except for Turing instability, other mechanisms of pattern formation in RD systems are not well understood. For example, in Fig. 1b, before Turing instability occurs (i.e., H state is stable), can large perturbations of H state develop stable spatial patterns? There are some existing works in RD systems supporting the coexistence of multiple H states [23], [24], [25]. For example, pattern formation can occur with equal diffusion coefficients in specific conditions where steady patterns could emerge from finite amplitude perturbations of a stable H state [23]. However, mechanisms of nonlinear instability for different RD models could be different. A systematic approach is desired to efficiently search for spatial stable and unstable patterns and reveal the underlying mechanism of RD systems.

In Turing’s original paper and most of the work afterwards, noise was not considered. However, dynamics of pattern formation in realistic biological systems are subject to strong noise due to the finite number of molecules involved in biochemical reactions. Fig. 1c is an example of pattern transition under noise. On a large time scale, the pattern with two peaks are more stable than the pattern with three peaks, hence accurately guarantees a specific spacing between concentration peaks. Given that spatial order under noisy environment is crucial in many biological processes [26], [27], an important question is how patterns maintain their spatial accuracy amid large spatial-temporal noise in the underlying biochemical reactions.

To address the two aforementioned fundamental problems in RD systems, i.e., nonlinear mechanism for pattern formation and robustness of spatial patterns, we introduce a solution landscape approach to systematically search the concentration functional space for steady-state solutions. Application of the solution landscape approach to generic RD models reveals a general nonlinear mechanism for pattern formation in the subcritical regime before the onset of the Turing instability. Next, based on the solution landscape framework, we develop a method to evaluate the stability of any given spatial pattern against noise by employing the concept of “action” from Freidlin-Wentzell large deviation theory [28], [29]. We apply the action-based stability analysis method to study a reversible three-species RD model. We show that the addition of the third species is crucial for stabilizing the spatial pattern against noise and significantly reduces fluctuations in spatial patterns despite its weak interactions with the other two chemical species.

2. Materials and methods

Two-species reaction-diffusion (RD) systems are simple but typical in generating spatial patterns. The deterministic dynamics of the two-species RD system can be generally formulated as:

∂u∂t=D1Δu+f(u,v),∂v∂t=D2Δv+g(u,v), (1)

where u and v are spatiotemporal variables representing concentrations of reactants. D1 and D2 are diffusion constants of two species, u and v, respectively. Functions f(u,v) and g(u,v) contain nonlinear terms representing biochemical reactions.

To find all possible stationary solutions, many numerical algorithms, e.g., the eigenvector-following method [30], [31], the numerical polynomial homotopy continuation method [32], the deflation technique [33], and the WKBJ-based approach [34], have been developed. However, since these methods rely on suitable initial guesses, they may not find all the solutions and more importantly, they can not reveal the relationships between different solutions. Here, we introduce the solution landscape approach based on the generalized high-index saddle dynamics (GHiSD) to construct the solution landscapes of RD systems.

The solution landscape is a pathway map consisting of all stationary states and their connections [35], [36]. In an energy-based (or gradient) system, the solution landscape can be efficiently constructed by the high-index saddle dynamics (HiSD) [37] method combined with downward/upward search algorithms, and it has been successfully applied to Ginzburg–Landau model for phase transition [36], Landau–de Gennes model for liquid crystals [35], the Gross-Pitaevskii model for Bose–Einstein condensation [38], the Lifshitz–Petrich model for quasicrystals [39], etc. In this paper, we introduce GHiSD, which is modified from HiSD, in order to construct the solution landscapes for non-gradient systems.

Mathematically, we view stable stationary states as the sinks of the dynamic systems, and unstable stationary states are the saddle points. Here we adopt the index theory from infinite dimensional Morse theory [40] to give a rigorous mathematical description of topological invariants for saddle points of partial differential equation systems. The Morse index characterizes the nature of the nondegenerate saddle point, and an index-k saddle point (k-saddle) is a stationary state whose Jacobian matrix has exactly k eigenvalues with a positive real part [41]. From this perspective, a sink (referring to the fixed-point type in this paper) can be regarded as a 0-saddle point and two neighboring sinks are connected by a 1-saddle point (i.e., transition state). Every stationary solution is assigned an index. Particularly, a homogeneous solution with a nonzero index indicates the occurrence of Turing instability.

Morse theory provides a natural directed connection from higher-order saddles to lower-order saddles via the negative gradient flow in gradient systems [40], [42], [43]. This hierarchical structure according to Morse index forms a pathway map. In the non-gradient system, the solution landscape is a generalized pathway map aiming to reveal connections of all stationary states. The GHiSD algorithm combined with downward/upward search algorithms is applied to construct the solution landscape for the non-gradient system.

In Eq. (1), let u=(u,v)⊤, F(u)=(D1Δu+f(u,v),D2Δv+g(u,v))⊤ and this RD system could be written as: ∂u∂t=F(u), the formulation of GHiSD for a k-saddle (k-GHiSD) can be written as follows.

{∂u∂t=(I−2∑j=1kwjwj⊤)F(u),∂wi∂t=(I−wiwi⊤)Jwi−∑j=1i−1wjwj⊤(J+J⊤)wi,i=1,…,k. (2)

The k-GHiSD involves a spatiotemporal variable u representing the concentrations of various substances and k direction variables {wi}i=1k approximating an orthonormal basis of the unstable subspace of the k-saddle. F is an operator on the spatiotemporal concentration function u, and J(u)=δFδu is the Jacobi operator.

The downward search algorithm is to apply GHiSD starting from a high-index m-saddle u* as a parent state to search for a low-index k-saddle (k<m). The initial searching position u0=u*±δu is chosen to push the system away from u*, and the pushing direction δu is along with a linear combination of (m−k) vectors whose negative eigenvalues have the smallest magnitudes chosen from {wi*}i=1m, which are the basis vectors of the unstable subspace (real Schur vectors) at u*. When a complex eigenvalue with a negative real part includes, the pushing direction is along with the unstable subspace composed of the corresponding eigenvectors.

Also we have the upward search algorithm as an auxiliary to find higher-index saddles, especially the parent state(s) of the entire solution landscape. The combination of GHiSD and downward/upward search navigates the entire search up and down to construct the complete solution landscape containing the homogeneous state. The details of the GHiSD algorithm and downward/upward search in constructing the solution landscape are documented in Appendix A and Appendix B. The details of the spatial discretization in GHiSD of RD systems is provided in Appendix F.

3. Results

3.1. Pattern formation in supercritical turing regime

Here we will mainly focus on the 2-D Schnakenburg model [44], a minimal chemically realistic model that can give rise to Turing patterns [34], [45], [46], while our methodology can be applied in general RD models. The Schnakenburg model is described by PDEs in Ω=[0,L]×[0,L]:

∂u∂t=Δu+η(a−u+u2v),∂v∂t=dΔv+η(b−u2v). (3)

The model corresponds to the following reactions

2u+v→η3u,⌀→ηau,u→η⌀,⌀→ηbv.

Here u,v represent the density of activator and substrate(inhibitor) respectively and ⌀ represents the empty state. Parameter d denotes the relative diffusion constant of two species and η represents a relative balance between the diffusion and the chemical reaction. Parameters a and b are the constant speeds of two species produced in the domain uniformly respectively. The boundary condition is generally set as no-flux conditions for both species, i.e. ∂u∂n|∂Ω=∂v∂n|∂Ω=0. Noted that the Schnakenberg model we used is non-dimensionalised PDEs and the parameter that truly determines the system’s diffusive behavior is ηL. An equivalent way to study the scale effect is to fix L=1 and change η in the experiment.

Many theoretical analyses have been done based on local linearization and excitable modes [47], [48] and have explained the influence of domain size of this model to generate Turing instability [49], [50]. Here, we use the solution landscape approach to map out all the steady state solutions in the parameter space.

We start with the unique, homogeneous stationary solution, i.e., H state, (u0,v0)=(a+b,b(a+b)−2) in the Schnakenburg model Eq. (3). Using the linear stability analysis [16] (see details in Appendix C), the Morse index of H state can be explicitly calculated as Table 1.

Table 1.

Morse index of the H state with differentdin the Schnakenburg model (η=200,L=1,a=13,b=23).

d (0,44.6) (44.6,47.4) (47.4,58.4) (58.4,74.9) (74.9,+∞)
Index 0 2 3 5 7

The H state is a stable sink when d is less than a critical value d0=44.6. When d>d0, the H state losses its linear stability and stable spatial solutions emerge from the H state via pitchfork bifurcations, which is exactly the Turing mechanism. Two questions immediately present themselves: How many stable solutions are there in the supercritical regime (d>d0)? More importantly, are there any stable solutions in the subcritical regime (d<d0)? We address these two questions below by using the solution landscape approach.

To find solutions in the supercritical regime, we start with the H state as the parent state at L=1. Here, we choose d=46 where the H state is a 2-saddle in the solution landscape. By applying the downward search algorithm, we can find all possible stationary states (1-saddles and stable sinks) that originate from the H state as shown in the region enclosed by the red dotted line in Fig. 2. The H state gives rise directly to one sink (S) and two 1-saddles M - and Bh, which subsequently give rise to T - & D sinks and P & C sinks, respectively. Note that the S, P and C states correspond to the same sink due to the symmetry of the pattern and boundary conditions. We validate this result by direct simulations of Eq. (3) using random perturbations of the H state (see details in Appendix D).

Fig. 2.

Fig. 2 dummy alt text

Solution landscape of the Schnakenberg model in the supercritical regime (d=46>d0) withη=200 and L=1. Only u is shown in the figure (the same way in the following figures). When Turing instability occurs, H state is a saddle which generates multiple stable patterns. Pattern formation induced by Turing instability is highlighted in red dashed line area. Using the index-3 Bv as the parent state, the solution landscape shows more saddle points and new stable sinks. The nomenclature of stationary patterns is based on the shape and symmetry. The capital letter S (square), T (triangular), P (polar), C (circular), D (diagonal), B (banded), E (elliptical) and M (mixed) is to classify the shape roughly. The lowercase letter d (diagonal), x (x-axis symmetric), h (horizontal), v (vertical), n (not symmetric), + (some part additional), - (some part missing), m (minor in intensity) is used to mark the remaining or broken symmetry of patterns.

Although multiple sinks are generated from the H state through Turing instability, it is unclear whether it is the only way to generate stable solutions. To address this question, we apply the upward search starting from the known sinks to find other possible parent states. In particular, we pick T - as the starting state and use the upward search to find an upward pathway T - → Tn → Pn → Bv, in which Bv is a band-shape 3-saddle that has a higher index than that of H. Using Bv as the new parent state, we are able to compute a complete solution landscape shown in Fig. 2. It shows that there exist more 2-saddles (e.g. M+, Sd, Pnx, Pn and E) other than H, which connect new 1-saddles and then two new sinks, Sdn and T. Both these new sinks are easily found by using downward search through downward pathways from Bv, for example, Bv → M+ → Sx+ → Sdn and Bv → Pn → Tn → T. However, there is no pathway connecting H to Sdn and T, indicating that neither Sdn nor T can be generated by Turing instability.

3.2. Pattern formation in subcritical turing regime

The appearance of Bv, whose Morse index is higher than H, suggests that there may exist other mechanisms besides Turing instability for pattern formation. This prompt us to investigate the solution landscape of the Schnakenburg model in the subcritical regime (d<d0=44.6) where the H state is stable. We find that the stable H state is the only stationary state for d≤36 (Fig. 3a). As d increases to 37, a pair of stationary states, Tm (1-saddle) and T (stable sink), emerges via a saddle-node bifurcation (Fig. 3b). If d becomes larger, more stationary states can be identified by applying the GHiSD method. For example, when d=39, Sm is found to be a 4-saddle. Using Sm as the parent state, we construct the corresponding solution landscape in Fig. 3c. It shows that four inhomogeneous sinks (S, T, P and C) exist besides H. Although S, P and C can be generated by Turing instability in the supercritical regime when H loses its stability at d=46, the emergence of these three states in the subcritical regime is due to some other mechanisms. By applying GHiSD for different values of d in the subcritical regime, we obtain the bifurcation diagram (Fig. 3d), which clearly shows that there exist a series of saddle-node bifurcations that generates stable sinks (T, S, P and C) while H remains stable. Note that the stable sinks can arise by infinitesimal perturbation from the H state in the supercritical regime. In contrast, when H is a stable sink in the subcritical regime, even though there exist transition pathways connecting H to certain inhomogeneous stable sinks such as T, S and C, a finite perturbation is required to overcome the transition barrier determined by transitional 1-saddle points, namely Tm, Tn - , Sdn and Cm.

Fig. 3.

Fig. 3 dummy alt text

(a-c) Solution landscapes in the subcritical regime (d<d0=44.6) with the relative diffusion speed d=36 (a), 37 (b), and 39 (c) at η=200 and L=1. From (a) to (c), solutions become abundant though H state is stable. (d) Bifurcation diagram of stationary solutions with increasing d.

In Fig S1 in the Supplementary Information we compare the basins of attraction of sinks when d=39. By linearly combining stable sinks and study the asymptotic pattern, we find that inhomogeneous sinks have quite large basins of attraction, indicating that these sinks are non-negligible subcritical patterns before the onset of the Turing instability. We further test the space of stable perturbations for each sink when d=39 by adding additive Gaussian white noise u(x)=max(u*(xij)+ϵσ(xij),0),1≤i,j≤32, on a 32×32 coarse grid of Ω=[0,1]×[0,1], where σ(xij)∼N(0,1) and are independent for different (i,j). u* represents stable sinks P,T,S,C and H. The asymptotic behavior indicates whether the state has escaped from the original stable sink. The escape ratio as a function of the amplitude ϵ is shown in Fig S1(d). When the amplitude ϵ<1, transition can seldom occur (escape ratio <1%) between these five sinks under perturbation. Considering that the concentration of species v is 0.5∼0.7 in stable patterns, ϵ=1 is quite large in the coarse grid, thus every sink is stable against large perturbations. The amplitude for 10 % samples of perturbations to escape from original sinks (defined as ϵ0.1) is ϵ0.1=1.2∼1.7 for P,T,S and C. The amplitude for H is much bigger (ϵ0.1>2) and it is not shown in Fig S1(d). We can conclude that the basin of attraction for each stable state has a quite large threshold for Gaussian-type perturbations.

To check whether the subcritical pattern formation depends on the system size, we also study the Schnakenburg model for different L (size of the square domain) and d. The phase diagram in the (L,d) space with η=50 fixed is shown in Fig. 4 where we plot the first saddle-node bifurcations with the corresponding solution landscapes as well as the Turing instability onsets for different values of L. It is clear from Fig. 4 that the first saddle-node bifurcation always occurs before Turing instability independent of system sizes. This nonlinear mechanism increases the parameter space where stable patterns exist beyond those originated from the Turing instability. We have also checked that different boundary conditions do not alter the main conclusions of this paper (see Fig S2 in the Supplementary Information for results with periodic boundary conditions).

Fig. 4.

Fig. 4 dummy alt text

Phase diagram for the first pattern formation over differentdand square domain sizesLwithη=50fixed. The blue curve represents the Turing instability. The red curve represents the first saddle-node bifurcation, including three different saddle-node bifurcations (corresponding solution landscapes are inserted containing one 1-saddle and two sinks) separated by black dash lines.

Finally, to test the universality of our findings in the Schnakenburg model, we examine the solution landscape of the Gierer-Meinhardt model [2], [51]. The results in Fig S3 in the Supplementary Information support the existence of a general subcritical saddle-node bifurcation mechanism for pattern formation in RD systems.

3.3. Stability of spatial patterns against noise in solution landscape

The precise positioning of biomolecules is essential for many biological processes such as cell division and development. However, for biological systems, the size of the system and the number of molecules in the system are relatively small. As a result, dynamics underlying pattern formation in biological systems are subject to finite size effects and large stochastic fluctuations (noise). Therefore, understanding stability of various pattern forming states against noise is critical for understanding robustness of precise positioning in biological systems. For example, although a two-species RD system can generate spatial patterns, Murray & Sourjik recently highlighted the significance of an additional third species for enhancing the positional accuracy of Turing patterns in noisy biological systems [52].

Here we consider a reversible three-species RD model in Fig. 5a proposed by Zhang et al. [53] where it was shown numerically that patterns formed in a two-species model are extremely sensitive to noise, and addition of the third species in the RD system can stabilize the patterns even with weak interaction strength (or equivalently small reaction rates). Reactions of this reversible model involve three linear reactions between each pair of three species X1,X2,X3 and a nonlinear auto-catalytic reaction between X1 and X2:

X1⇌k12k21X2,X2⇌k23k32X3,X3⇌k31k13X1,X1+2X2⇌k˜12k˜213X2.

Fig. 5.

Fig. 5 dummy alt text

(a) Accurate positioning phenomena in three-species RD system. In the absence of the third species, patterns show considerable fluctuations. As long as the third species is introduced, although the interactions involved are very weak, patterns are positioned robustly.(b-d) Solution landscapes under parameter τ=0 (b), τ=0.1 (c) and τ=1 (d). Curves stand for spatial concentration of X2 in the region Ω=(0,6). Sinks, 1-saddles and transition pathways are shown while high-index saddles are omitted. Blue underlines stand for the original stable patterns in τ=0 case while red underlines stand for newly formed stable patterns. “S” in the name of solutions represents for sinks and “T” for 1-saddles. The homogeneous state H is a 24-saddle in each solution landscape. The values of the coordinates are the same as those of the H states in (b-d). The number of the pattern’s peaks is used to name the pattern, and h denotes half peak. The apostrophe is used to distinguish patterns of the same number of peaks.

In the absence of noise, dynamics of three species’ concentration u1,u2,u3 can be described by deterministic PDEs:

∂u1∂t=−k˜12u1u22+k˜21u23+k21u2−k12u1−k13u1+k31u3+D1∂2u1∂x2,∂u2∂t=k˜12u1u22−k˜21u23−k21u2+k12u1+k32u3−k23u2+D2∂2u2∂x2,∂u3∂t=−(k32+k31)u3+k13u1+k23u2+D3∂2u3∂x2, (4)

where x∈Ω=(0,6) and ui(i=1,2,3) satisfy no-flux boundary conditions. The reaction rate constants k˜12,k˜21,k12,k21 between X1 and X2 are fixed as k˜12=1.67×10−5, k˜21=2.40×10−6, k12=0.5, and k21=3.6. The diffusion coefficients are chosen as D1=D3=1.8, D2=0.012 such that the diffusion ratio d=D1/D2=150 is deep inside the Turing instability regime.

The reactions between the additional third species X3 and X1,2 are described by four reaction rates k13=k23=0.0139τ, k31=0.0416τ and k32=0.00139τ where we introduce a scaling constant τ to control the interaction strength between X3 and X1,2. τ=0 representing the two-species model. Note that the interaction is weak even when τ=1 given the relatively small rates involving X3. Our goal is to determine the stable solutions (sinks) and their stability as τ varies by using the solution landscape approach.

X3 introduces more stable patterns with higher wave numbers. The solution landscapes corresponding to different values of τ(=0,0.1,1) are constructed. In Fig. 5, we show all 1-saddles and sinks as well as transition pathways connecting them. In the two-species model (i.e. τ=0 case), the solution landscape (Fig. 5b) has six sinks (underlined with a blue line) and six 1-saddles with relatively smaller wave numbers. As τ increases, more stable modes emerges in addition to the existing stable modes in the two-species model. These additional stable modes (1 for τ=0.1, 4 for τ=1, underlined with a red line respectively) have higher wave numbers as shown in Fig. 5c-d. The bifurcation diagram containing sinks and 1-saddles are documented in Fig S4 in the Supplementary Information. The emergence of these new patterns as τ increases can be understood in Fig S4(a), which shows the maximal real part of the eigenvalues (max(Reλ)) of 1-saddles (dotted line) and sinks (solid line) when τ increases from 0 to 1. Patterns with more than two peaks emerge via bifurcations when τ reaches some positive critical values when their corresponding max(Reλ) becomes positive. Three consecutive bifurcations highlighted by red circles in Fig S4a are shown in details in Fig S4b-d near their bifurcation points where newly generated stable stripe-patterns are also plotted in insets. Wave numbers of newly generated patterns increase 12 for each consecutive bifurcation as τ is increased.

X3 enhances stability of the patterns. Besides creating more stable patterns with higher wave numbers, the most important effect of the third species is to stabilize the two-species solutions (τ=0). As shown in Fig S4(a), as τ approaches 0, the maximal real parts of eigenvalues for the stable solutions are extremely small indicating poor positioning accuracy of the patterns in the presence of noise. However, the introduction of X3 enhances the stability of sinks as max(Reλ) decreases significantly with the increase of τ.

To quantify the stability of the spatial patterns, we employ “action” based on Freidlin-Wentzell large deviation theory within the framework of solution landscapes. In particular, the action of a given path φ:[0,1]→H from φ(0) to φ(1) is defined as follows [54]:

S^(φ)=infT>0infψ∈C¯φ(0,T)ST(ψ), (5)

where C¯φ(0,T) stands for all absolutely continuous functions on [0,T] whose image in the Hilbert space H is the path φ([0,1]). Action S^(φ) is parametrization free. It can be regarded as the cost of changing the system from state φ(0) to state φ(1) along the path φ, and plays the role of energy cost in non-gradient systems. ST(ψ) is determined by the Lagrangian of the dynamics Eq. (4) (see details of the model’s action formula in Appendix E):

ST(ψ)={∫0TL(ψ,ψ˙)dtifψisabsolutelycontinuousandtheintegralconverges,+∞otherwise, (6)

Since pattern formation results in breaking of translation invariance in the spatially homogeneous system, the translation degree of freedom reflects the (approximate) degeneracy of solutions, and it corresponds to the least costly mode (the “soft” mode) in the system. Therefore, to evaluate the stability of the spatial patterns, we take the deviation Δ to be the spatial translation distance and compute the action S(Δ) along the path of deviation Δ numerically (see Appendix E for details).

In Fig. 6, the action-deviation S−Δ relations for different values of τ=0,0.1,1 are shown for all six stable solutions (Sh, S1, S1′, S1h, S2 and S2′) in the two-species model (τ=0). It is clear that the action curve of each sink bends up as τ increases indicating the stabilizing effect of X3. The S−Δ relations of the 6 sinks at τ=0 are shown in detail in Fig S5(a) in the Supplementary Information. With the exception of S2′, all the sinks show weak resistance to small shift indicating their weak stability against noise. In particular, Sh and S1 can shift freely with near zero action cost in a rather wide range of Δ, which implies that each of them is degenerate and lies in a one-dimensional solution manifold of Eq. (4).

Fig. 6.

Fig. 6 dummy alt text

The action-deviation (S−Δ) relations withτ=0,0.1,1for the 6 sinks emerged in the two-species case (see the six sinks inFig. 5(b)). The solution profiles for X2: u2(x) are shown in the insets.

To quantify the effect of X3, we take the rightward shift (i.e. Δ≥0) as an illustration (since S−Δ curves for Sh, S1h are not axisymmetric, the shift towards two directions are different). As shown in Fig S5b, the action-deviation relations under different values of τ in log-log coordinates imply that S depends on Δ quadratically with its coefficient C(τ) depending on τ:

S(Δ)=C(τ)Δ2. (7)

To the leading order, we have:

C(τ)=ϵ+ητ+O(τ2), (8)

where ϵ and η are different for different solutions. Table 2 shows ϵ and η for the six solutions that exist in the two-species model.

Table 2.

Expansion coefficientϵandηfor six stable solutions.

Sh S1 S1′ S1h S2 S2′
ϵ <10−4 <10−4 170 2.4×104 60 2.7×105
η(×105) 4.7 3.1 5.9 3.1 2.3 3.8

The value of ϵ reflects the resistance to positional fluctuations when τ=0, and η characterizes the growth of such resistance as τ increases (larger C leads to smaller fluctuation and thus higher accuracy). Given that τ∼O(1) has already been regarded as weak coupling for X3 in the system, the large value of the ratio ηϵ reflects the strong effect of X3 in stabilizing the sink solutions. The quadratic action gives rise to an effective Ornstein-Uhlenbeck process to describe the time evolution of shift Δ under noise:

dΔt=−2(ϵ+ητ)Δtdt+σdWt.

Thus Δt→N(0,σ24(ϵ+ητ)) as t→+∞, which clearly shows that the introduction of the third species (τ>0) increases the stability of the sink solutions. Without X3, stability of the sinks is controlled by ϵ, which depends on the curvature of concentration functions near the boundary as shown in Appendix E. Therefore, for solutions Sh,S1,S1′ and S2 where ϵ is small due to their approximate translation invariance near the boundary, their stability is provided predominantly by X3. Even for solutions S1h and S2′ with relatively larger ϵ, their stability is enhanced significantly by X3 given the large value of η (see Table 2). Intuitively, fluctuations with long wave length, especially the shift of patterns are dampened by the non-local effect raised from a larger length scale of X3 [53].

4. Discussion

In summary, we have developed an efficient numerical method to systematically construct the solution landscape of reaction-diffusion (RD) systems allowing us to find all possible stationary states connected to a homogeneous state and identify their relationships. By applying this general method to prototype RD models such as the Schnakenburg model and the Gierer-Meinhardt model, we discover a general nonlinear pattern formation mechanism wherein multiple stable heterogeneous states can emerge via saddle-node bifurcations and co-exist with the homogeneous state in the subcritical Turing regime before the onset of the linear Turing instability. However, the generality of this nonlinear instability across various RD models remains unclear. Specifically, there exists no unified criterion to determine under what conditions the parameter region of linear instability for an arbitrarily-designed RD system is encompassed within its region of nonlinear instability. Also, models with multiple H states may have complicated pattern formation before any H state loses its stability [23], [24], [25]. Our solution landscape approach is generic and can gain deeper insights in different RD models by systematically and efficiently calculating stationary patterns.

Furthermore, within the solution landscape framework, we developed a method to evaluate the stability of spatial patterns quantitatively by using action to describe the cost of deviation from the pattern caused by noise. To demonstrate its utility, this general method is applied to explain robust positioning of spatial patterns in a reversible three-species RD system with large intrinsic noise. Our method reveals the underlying mechanism for robust self-positioning even for very weak interactions of the third species with the other two chemical species in the system.

It is worth mentioning that we consider the robustness of deterministic patterns in deep region of Turing instability parameter space in the positioning of spatial patterns. The number of molecules within a correlation length of the system is very large. Therefore, spatial patterns are mainly the diffusion-driven type given by deterministic PDE models. However, fluctuation-driven stochastic “quasi-patterns” could emerge before Turing instability [55], [56], [57] and coexist with diffusion-driven patterns[58]. These stochastic “quasi-patterns” are not solutions to PDEs but may be important in the pattern positioning of real biological systems. The mechanism for robustness of “quasi-patterns” is different from the deterministic case and we leave it for future study.

As a generalization of high-index saddle dynamics (HiSD) developed to construct the solution landscape of gradient systems, the generalized high-index saddle dynamics (GHiSD) method presented in this study can be applied in generic PDEs including non-gradient systems to search for multiple stationary solutions and to uncover the pathways that connect these solutions. Besides the RD systems studied in this paper, GHiSD could also be used in convection-diffusion equations [59], [60], transport equations [61] and nonlinear Schrödinger equations [62]. However, for a model containing discrete variables (such as the Boolean type variable), HiSD and GHiSD fail to solve the minima and saddle points on the discrete energy landscape, because the execution of iteration in saddle dynamics depends on differentiation and the information of Hessian matrix.

From the theoretical and computational perspective, the solution landscape approach provides an efficient tool and a unifying view of pattern formation in RD systems. The general solution landscape approach could be instructive in studying pattern selection in synthetic systems [63], designing programmable reaction-diffusion systems [64], as well as understanding network robustness [65], from micro-scale systems such as cell regulation to macro-scale systems such as ecological networks [66].

CRediT authorship contribution statement

Shuonan Wu: Writing – review & editing, Writing – original draft, Validation, Methodology, Investigation, Formal analysis. Bing Yu: Methodology, Investigation, Formal analysis. Yuhai Tu: Writing – review & editing, Writing – original draft, Supervision, Formal analysis. Lei Zhang: Writing – review & editing, Writing – original draft, Supervision, Project administration, Investigation, Funding acquisition, Formal analysis, Conceptualization.

Declaration of competing interest

The authors declare that they have no conflicts of interest in this work.

Acknowledgments

We would like to thank Prof. Ou-yang Qi and Dr. Jianyuan Yin for helpful discussions. L.Z. is supported by the National Key Research and Development Program of China (2024YFA0919500) and the National Natural Science Foundation of China (12225102, T2321001, 12288101, and 12426653). Y.T. is supported by a NIH grant (R35GM131734).

Biographies

Shuonan Wu is currently a Ph.D. candidate in School of Mathematical Sciences, Peking University.

Yuhai Tu graduated at University of Science and Technology of China (USTC) in 1987. In 1991, he got his Ph. D from UCSD and was awarded the Division Prize Fellow at California Institute of Technology (Caltech) for his postdoc research. In 1994, he joined the IBM T. J. Watson Research Center as a permanent research staff member (RSM). He has been the manager of the theory and computational physics group at IBM Watson Research Center since 2002. His main research interests are statistical physics, nonlinear dynamics, surface physics and most recently computational biophysics. He has been an American Physical Society (APS) Fellow since 2004. He has been a ChangJiang visiting professor at Peking University since 2007.

Lei Zhang is a Boya Distinguished Professor at Beijing International Center for Mathematical Research, Peking University. He is also a Principle Investigator at Center for Quantitative Biology and Center for Machine Learning Research. He obtained his Ph.D in Mathematics at Penn State University in 2009. His research is in the area of computational and applied mathematics and interdisciplinary science in biology, materials, and machine learning. He has published the papers in Phys. Rev. Lett., PNAS, Acta Numerica, Science journals, Cell journals, SIAM journals. He was awarded/funded by NSFC Innovation Research Group, NSFC Outstanding Youth Award, National Key Research and Development Program of China, NSFC Excellent Youth Award, Royal Society Newton Advanced Fellowship, etc. He serves as an associate editor for SIAM J. Appl. Math, Science China Mathematics, CSIAM Trans. Appl. Math, DCDS-B, The Innovation, etc.

Footnotes

Peer review under the responsibility of Editorial Board of Fundamental Research.

Contributor Information

Yuhai Tu, Email: yuhai@us.ibm.com.

Lei Zhang, Email: zhangl@math.pku.edu.cn.

Appendix A. GHiSD algorithm

The high-index saddle dynamics (HiSD) algorithm aims to find the index-k saddle point (k-saddle) starting from an initial guess u0. It is initially designed for gradient systems [35]. Given a twice differentiable energy function E(u), where u∈Rn is a vector variable, the HiSD algorithm is a pseudo-dynamics depicting the time derivatives u˙ and wi˙. Here wi approximates the normalized eigenvector corresponding to the ith smallest eigenvalue, where i=1,…k. The HiSD for a k-saddle can be formulated as:

{u˙=−(I−∑i=1k2wiwi⊤)∇E(u),wi˙=−(I−wiwi⊤−∑j=1i−12wjwj⊤)G(u)wi,i=1,…k. (A.1)

where G(u) is the Hessian matrix of E(u). A k-saddle u* along with its k unstable eigenvectors w1,…,wk will be attained, directly connected by u0. Here 〈wi,wj〉=δij follows the orthonormal constraint for every t confirmed by Eq. (A.1).

For the non-gradient system u˙=F(u), we modify HiSD by replacing −G(u) with Jacobi operator J(u) and do some changes to the dynamics of {wi} to guarantee their orthonormality since J(u) is not self-adjoint. Then we get the generalized high-index saddle dynamics (GHiSD) for a k-saddle:

{u˙=(I−2∑j=1kwjwj⊤)F(u),w˙i=(I−wiwi⊤)J(u)wi−∑j=1i−1wjwj⊤(J(u)+J⊤(u))wi,i=1,…,k. (A.2)

In numerical implementation, the above dynamics are discretized in time using explicit Euler schemes on u(m) (m denotes the discrete time step of the pseudo-dynamics) and semi-implicit scheme for {wi}. Since the Jacobian is usually expensive to compute, we adopt the dimer method to avoid evaluating the Jacobian explicitly.

{u(m+1)=u(m)+α(F(u(m))−2∑j=1k〈F(u(m)),wj(m)〉wj(m))w˜i(m+1)=wi(m)+βJ(u(m+1))wi(m),i=1,…,k,[w1(m+1),…,wk(m+1)]=orth([w˜1(m+1),…,w˜k(m+1)]) (A.3)

where α and β are step sizes which are supposed to be sufficiently small to ensure the numerical stability. J(u)wi can be approximated as (F(u+lwi)−F(u−lwi))/2l by a dimer method with a small constant l>0.

The initial unstable subspace of J, noted as Wu(u), can be established by iteration of the orthonormal vector set {w1,…,wk} starting from k random initial vectors, which can be regarded as a power method of I+βJ:

{w˜i(m+1)=wi(m)+βJ(u)wi(m),i=1,…,k[w1(m+1),…,wk(m+1)]=orth([w˜1(m+1),…,w˜k(m+1)]) (A.4)

In the Schnakenburg model, F and J can be formulated as:

F(u)=(Δu+η(a−u+u2v)dΔv+η(b−u2v)). (A.5)
J(u)(fg)=(Δf+η(2uv−1)f+ηu2g−2ηuvf+dΔg−ηu2g), (A.6)

where u=(u,v)⊤, f and g are arbitrary C2(Ω) functions for spatial variables.

Appendix B. Downward and upward search

To identify all stationary states, we combine GHiSD with the following downward and upward search algorithms to construct the solution landscape.

To construct dynamic relations between two saddles, we pick a k-saddle u0 as the initial state and search for (k−1)-saddles (or lower index saddles) using GHiSD. Once a new (k−1)-saddle is found, an arrow from u0 to this saddle is drawn in the solution landscape to illustrate this relationship (see Fig. 2 for illustration). Based on (k−1)-saddles we can repeat the process above and construct a map revealing the evolutionary interrelationship between stationary states which we name the solution landscape. We call this kind of strategy searching from top to bottom the downward search strategy [35].

The downward search for k-saddles (k<m) can be numerically realized as follows. Given an m-saddle u* as the parent state, along with m unstable orthonormal vectors {wi}i=1m in Wu(u) (the unstable subspace), we choose a linear combination of {wi}i=1m, denoted as w^, and set the starting state for GHiSD as u0=u*±ϵw^ to give a small perturbation. Then a k-GHiSD starts at u0 with k orthonormal vectors chosen from {wi}i=1m perpendicular to w^.

In the downward search from an m-saddle searching k-saddles by k-GHiSD, a preliminary attempt to choose w^ is to try: w^=wi,i=1,…m, and set the initial state of k-GHiSD as (u*±ϵwi;w1,…,wk), if i>k ; (u*±ϵwi;w1,…,wi−1,wi+1,…,wk+1), if i≤k. Intuitively, this strategy makes the system to stay unstable in the chosen k directions but to roll off the original m-saddle in other (m−k) directions containing the perturbation direction w^. As a result, k-saddles can be found.

We can also use upward search when the parent state(s) is unknown or we need the information of higher index saddles (especially the parent states) based on the existing sinks or saddles. The search for m-saddles (m>k) starting from a k-saddle u* can be implemented as follows. Choose a stable direction w^ and m orthonormal initial directions including w^ at u*. A typical choice for m-GHiSD upward search is (u*±ϵwm;w1,…,wm).

It has been proved that (u*,w1*,…,wk*) is a linearly stable stationary point of the k-GHiSD if and only if u* is a k-saddle of the dynamical system[36]. Thus both the downward search and the upward search can reach saddles of the specified order k if k-GHiSD converges.

Combining the downward and upward search, we can construct the solution landscape of general dynamic systems using GHiSD. However, noted that in a general dynamic system, it is possible for a solution landscape to have multiple disconnected branches. In this case, the GHiSD method with downward and upward strategies is a local deterministic method operating within a single branch. Without appropriate initial guesses, the GHiSD method is unable to find some branches, in particular the branch made up of an isolated stationary point.

Appendix C. Linear analysis of the Schnakenburg model

The 2D Schnakenburg model [45], [46] in Ω=[0,1]×[0,1] can be formulated as:

∂u∂t=Δu+η(a−u+u2v),∂v∂t=dΔv+η(b−u2v). (C.1)

Here two species u and v satisfy the no-flux boundary condition. Parameter d denotes the relative dispersal speed of two species and η represents a relative balance between the diffusion and the chemical reaction. a and b are the constant speeds of two species produced in the domain uniformly respectively. The system has a unique homogeneous state (H for short), (u0,v0)=(a+b,b(a+b)2). Here we give the procedure of calculating Morse index of H in the presence of diffusion.

Linear analysis is implemented as follows. Let the small-perturbation of H be:

u˜(x,t)=(u−u0v−v0). (C.2)

Now we look for the solutions of the form:

u˜(r,t)=∑kckWk(r)eλt, (C.3)

where Wk(r) is a time-independent term satisfying a homogeneous Helmholtz equation with no-flux boundary condition:

∇2W+k2W=0. (C.4)

The solution of Eq. (C.4) takes the form:

W=(Acos(mπx)cos(nπy)Bcos(mπx)cos(nπy)). (C.5)

Substituting Eqs. (C.3), (C.5) into Eq. (C.1) and taking a=13,b=23 and κ=k2=π2(m2+n2), we get the secular equation:

|−κ+η3−λη−43η−κd−η−λ|=0. (C.6)

Thus we have λ1+λ2=−(κd+κ+23η)<0, and then a λ with positive real part exists if and only if λ1λ2=κ2d+κη−13ηκd+η2<0. Finally we get the condition for Turing instability:

d>minκ∈Kη(κ+η)η3κ−κ2, (C.7)

where K={π2(m2+n2)|m,n∈N}. Morse index of the H state is obtained by counting the number of possible (m,n) pairs in K with a fixed d satisfying:

d>η(κ+η)η3κ−κ2, (C.8)

By choosing η=200,a=13,b=23, Morse index of the H state under different d is listed in Table. 1 of the text.

Appendix D. Direct simulation of the Schnakenburg model

Turing pattern can be obtained by using direct simulation of the Schnakenburg model. When the H state is unstable, we can add small perturbations to H as the initial guess, i.e., u=(u0+δu,v0+δv)⊤. Here the perturbations δu and δv can be generated as follows,

(δuδv)=∑m,n≤N(Am,ncos(mπx)cos(nπy)Bm,ncos(mπx)cos(nπy)), (D.1)

where N is a large integer and Am,n,Bm,n are uniform distributions sampled from [−ϵ/N,ϵ/N], where ϵ is a small positive value to control the intensity of the disturbance.

We numerically solve Eq. (C.1) using the explicit Euler scheme in time and the finite volume scheme (see Appendix F) in space. By taking η=200,d=46 and different initial u, we obtained five sinks T - , D, S, P, C by solving Eq. (C.1) (see Fig. 2 of the text). These results are in consistence with the sinks derived in the solution landscape by using H as the parent state.

Appendix E. Action-deviation relation S(Δ)

For the field dynamics defined by PDE of the form: ψ˙=F(ψ)=Δψ+f(ψ), Lagrangian in Eq. (6) is given by the Lagrangian density function L(ψ(x),ψ˙(x)):

L(ψ,ψ˙)=∫ΩL(ψ(x),ψ˙(x))dx (E.1)
L(ψ(x),ψ˙(x))=12(ψ˙−Δψ−f(ψ))2 (E.2)

In our three-species Turing model, Ω=(0,6). If the translation path φ(s),s∈[0,1] corresponding to deviation Δ (Δ≥0 for instance) is parameterized by:

φΔ(s)(x)≡usΔ(x)≡{(u1(x−sΔ),u2(x−sΔ),u3(x−sΔ))ifsΔ<x≤6(u1(0),u2(0),u3(0))if0≤x≤sΔ (E.3)

we can establish an explicit formula of action for Δ shift along this path:

S(Δ)≡S^(φΔ)=Δ∫01∥usΔ′(x)∥L2(Ω)·∥F(usΔ(x))∥L2(Ω)+〈usΔ′(x),F(usΔ(x))〉L2(Ω)ds (E.4)

where 〈·〉L2(Ω) is the inner product under L2(Ω) norm. This path φΔ(s),s∈[0,1] corresponds to a rightward shift process with constant speed v=Δ connecting the starting pattern u0(x)=(u1(x),u2(x),u3(x)) and the end pattern uΔ(x). Prolongation of left boundary of u0(x) is introduced artificially in Eq. (E.3) and obeys boundary conditions on the left (if Δ≤0, the boundary conditions are satisfied on the right).

For the translation path defined in Eq. (E.3), the second term of Eq. (E.4) vanishes. ∥usΔ′(x)∥L2(Ω) and ∥F(usΔ(x))∥L2(Ω) in the integral above can be explicitly expressed by the starting pattern u0(x)=(u1(x),u2(x),u3(x)):

∥usΔ′(x)∥L2(Ω)2=∫06−sΔ∑i=13(dui(x)dx)2dx∥F(usΔ(x))∥L2(Ω)2=sΔ∑i=13(Did2ui(x)dx2|x=0)2+Λ∑i=13(Didui(x)dx|x=6−sΔ−0−0)2 (E.5)

Where the last term in the expression of ∥F(usΔ(x))∥L2(Ω)2 is caused by boundary leaping of dui(x)dx given no-flux boundary conditions which results in the singularity when calculating the Laplace term of F. This can be viewed as the penalty term due to violation of boundary conditions. Λ is the penalty factor. Large Λ makes the choice of prolongation less important (and we may simply consider the very simple prolongation in Eq. (E.3). Actually according to expansion:

dui(x)dx|x=6−sΔ≈dui(x)dx|x=6−sΔd2ui(x)dx2|x=6=−sΔd2ui(x)dx2|x=6 (E.6)

we have

S(Δ)≈Δ2Λ(∑i=13(Did2ui(x)dx2|x=6)2)12∫01∥usΔ′∥L2(Ω)sds≈12Δ2Λ(∑i=13(Did2ui(x)dx2|x=6)2)12∥u0′∥L2(Ω) (E.7)

Thus C in Eq. (7) roughly depends on the second derivative of solution on the boundary:

C≈12Λ(∑i=13(Did2ui(x)dx2|x=6)2)12∥u0′∥L2(Ω) (E.8)

The relationship between C and τ is shown in the dependence of solution (u1(x),u2(x),u3(x)) on τ. By treating τ as a small coefficient we could calculate the first order perturbation of solutions based on Eq. (4). Let

ui(x;τ)=ui0(x)+τui1(x)+τ2ui2(x)+⋯i=1,2,3 (E.9)

and ui0(x),i=1,2 is the two-species solution in the absence of X3. u30(x) is a constant. The O(τ) term of Eq. (4) gives the equation to compute first order perturbation function ui1(x),i=1,2,3. This equation is a linear PDE:

Dd2u1(x)dx2=A(x)u1(x)+c(x) (E.10)

where u1(x)=(u11(x),u21(x),u31(x))⊤ and satisfies no-flux boundary conditions. D is the diffusion coefficient matrix. A=A(x) and c=c(x) are:

D=[D1000D2000D3] (E.11)
A=[k˜12(u20)2+k122k˜12u20u10−3k˜21(u20)2−k210−(k˜12(u20)2+k12)−(2k˜12u20u10−3k˜21(u20)2−k21)0000] (E.12)
c=[k13τu10−k31τu30k23τu20−k32τu30−(k13τu10−k31τu30)−(k23τu20−k32τu30)] (E.13)

According to Eq. (E.9), Eq. (E.8) can be formulated in the expansion of τ:

C(τ)=Λ2M(u0)×(1+τR(u0,u1)+O(τ2)) (E.14)

where

M(u0)=(∑i=13(Did2ui0(x)dx2|x=6)2)12(∑i=13∫06(dui0dx)2dx)12R(u0,u1)=∑i=13Di2d2ui0(x)dx2|x=6d2ui1(x)dx2|x=6∑i=13(Did2ui0(x)dx2|x=6)2+∑i=13∫06dui0dxdui1dxdx∑i=13∫06(dui0dx)2dx=∑i=12Di2d2ui0(x)dx2|x=6d2ui1(x)dx2|x=6∑i=12(Did2ui0(x)dx2|x=6)2+∑i=12∫06ui0d2ui1(x)dx2dx∑i=12∫06ui0d2ui0(x)dx2dx (E.15)

The last step uses integration by parts and u30(x)=const.. We get the final estimation for ϵ and η defined in Eq. (8):

ϵ=Λ2M(u0)η=Λ2M(u0)R(u0,u1) (E.16)

The ratio ηϵ is exactly the linear coefficient R(u0,u1). R(u0,u1)≫1 can be simply understood through the fact that:

|d2ui0(x)dx2|x=6|≪|d2ui1(x)dx2|x=6|,i=1,2d2ui0(x)dx2|x=6×d2ui1(x)dx2|x=6>0,i=1,2. (E.17)

Actually small second derivatives of u0 stem from the almost free shift in two-species case. For example when u is the solution S1, D1d2u10(x)dx2|x=6≈D2d2u20(x)dx2|x=6≈10−10, but ui1(x) is regularly solved from linear equation Eq. (E.10) thus d2ui1(x)dx2|x=6∼O(1),i=1,2. From Eq. (E.15) roughly we know M(u0)∝∑i=13Did2ui0(x)dx2|x=6 and R(u0,u1)∝(∑i=13Did2ui0(x)dx2|x=6)−1. In this sense, ϵ depends linearly on the second derivatives of species’ concentration on the boundary, which vary widely from solution to solution and could be very small. But η is more or less the same for different sinks.

Appendix F. Spatial discretization in RD model

We adopt finite volume method to do the spatial discretization in PDE models with no-flux boundary conditions in this article. We give the 1-D version of the discretization to solve the problem described by Eq. (1).

Given the region Ω=[0,L], let x12=0, xN+12=L, Δx=LN, xj+12=jΔx and tm=mΔt, where j=0,…,N and m∈N. We integrate the first equation of Eq. (1) on [xj−12,xj+12]×[tm,tm+1] and after integration by parts we have:

∫xj−12xj+12(um+1(x)−um(x))dx=∫tmtm+1(D1∂u∂x|xj−12xj+12+∫xj−12xj+12f(u,v)dx)dt, (F.1)

where um(x)≜u(x,tm). Let u‾jm=1Δx∫xj−12xj+12um(x)dx, f‾j=1Δx∫xj−12xj+12f(u,v)dx, we have:

u‾jm+1−u‾jm=∫tmtm+1(D1∂u∂x|xj−12xj+12+f‾j)dt≈Δt(D1Δx∂u∂x|xj−12xj+12+f‾j)m (F.2)

The last step above we adopt explicit Euler discretization in time. Take the following approximation:

∂u∂x(xj+12)≈{0,ifj=0orNuj+1−ujΔx,otherwisef‾jm=f(ujm,vjm) (F.3)

we get the discretization scheme of Eq. (1):

Ujm+1−UjmΔt=D1Uj+1m−2Ujm+Uj−1mΔx2+f(Ujm,Vjm),Vjm+1−VjmΔt=D2Vj+1m−2Vjm+Vj−1mΔx2+g(Ujm,Vjm),j=1,…,N (F.4)

and make conventions: U0m=U1m, UN+1m=UNm, V0m=V1m, VN+1m=VNm to satisfy the no-flux boundary conditions on x12=0 and xN+12=L. The discretization scheme can be easily extended to 2D square region and is used in the first equation of Eq. (2).

Supplementary material

Supplementary material associated with this article can be found, in the online version, at 10.1016/j.fmre.2025.10.006

Appendix G. Supplementary materials

Supplementary Data S1

Supplementary Raw Research Data. This is open data under the CC BY license http://creativecommons.org/licenses/by/4.0/

mmc1.pdf (3.9MB, pdf)

References

  • 1.Turing A.M. The chemical basis of morphogenesis. Bull. Math. Biol. 1990;52(1):153–197. doi: 10.1007/BF02459572. [DOI] [PubMed] [Google Scholar]
  • 2.Gierer A., Meinhardt H. A theory of biological pattern formation. Kybernetik. 1972;12(1):30–39. doi: 10.1007/BF00289234. [DOI] [PubMed] [Google Scholar]
  • 3.Kondo S., Miura T. Reaction-diffusion model as a framework for understanding biological pattern formation. Science. 2010;329(5999):1616–1620. doi: 10.1126/science.1179047. [DOI] [PubMed] [Google Scholar]
  • 4.Roth S. Mathematics and biology: A kantian view on the history of pattern formation theory. Dev. Genes Evol. 2011;221(5):255–279. doi: 10.1007/s00427-011-0378-0. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 5.Murray J.D. Parameter space for turing instability in reaction diffusion mechanisms: A comparison of models. J. Theor. Biol. 1982;98(1):143–163. doi: 10.1016/0022-5193(82)90063-7. [DOI] [PubMed] [Google Scholar]
  • 6.Ouyang Q., Swinney H.L. Transition from a uniform state to hexagonal and striped turing patterns. Nature. 1991;352(6336):610–612. [Google Scholar]
  • 7.Maini P.K., Painter K.J., Helene N. Spatial pattern formation in chemical and biological systems. J. Chem. Soc. Faraday Trans. 1997;93(20):3601–3610. [Google Scholar]
  • 8.Alon U. Chapman and Hall/CRC; 2019. An Introduction to Systems Biology: Design Principles of Biological Circuits. [Google Scholar]
  • 9.Maini P.K., Woolley T.E., Baker R.E., et al. Turing’s model for biological pattern formation and the robustness problem. Interface Focus. 2012;2(4):487–496. doi: 10.1098/rsfs.2011.0113. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 10.Swindale V.N. A model for the formation of ocular dominance stripes. Proc. R. Soc. London. 1980;208(1171):243–264. doi: 10.1098/rspb.1980.0051. [DOI] [PubMed] [Google Scholar]
  • 11.Kondo S., Asai R. A reactiondiffusion wave on the skin of the marine angelfishpomacanthus. Nature. 1995;376(6543):765–768. doi: 10.1038/376765a0. [DOI] [PubMed] [Google Scholar]
  • 12.Petrov V., Ouyang Q., Swinney H.L. Resonant pattern formation in a chemical system. Nature. 1997;388(6643):655–657. [Google Scholar]
  • 13.Nakamasu A., Takahashi G., Kanbe A., et al. Interactions between zebrafish pigment cells responsible for the generation of turing patterns. Proc. Natl. Acad. Sci. 2009;106(21):8429–8434. doi: 10.1073/pnas.0808622106. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 14.Rauch E.M., Millonas M.M. The role of trans-membrane signal transduction in turing-type cellular pattern formation. J. Theor. Biol. 2004;226(4):401–407. doi: 10.1016/j.jtbi.2003.09.018. [DOI] [PubMed] [Google Scholar]
  • 15.Van D., Gascoigne J.C., Theraulaz G., et al. Experimental evidence for spatial self-organization and its emergent effects in mussel bed ecosystems. Science. 2008;322(5902):739–742. doi: 10.1126/science.1163952. [DOI] [PubMed] [Google Scholar]
  • 16.Murray J.D. Mathematical Biology. Springer-Verlag; 2003. [Google Scholar]
  • 17.Kovács S. Turing bifurcation in a system with cross diffusion. Nonlinear Anal. 2004;59(4):567–581. [Google Scholar]
  • 18.Rodrigues L., Mistro D.C., Petrovskii S. Pattern formation, long-term transients, and theturing–hopf bifurcation in a space- and time-discrete predator–prey system. Bull. Math. Biol. 2011;73(8):1812. doi: 10.1007/s11538-010-9593-5. [DOI] [PubMed] [Google Scholar]
  • 19.S. Smith, N. Dalchau, Beyond activator-inhibitor networks: The generalised turing mechanism, arXiv preprint arXiv:1803.07886(2018).
  • 20.Diambra L., Costa L.F. Pattern formation in a gene network model with boundary shape dependence. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 2006;73(3):031917. doi: 10.1103/PhysRevE.73.031917. [DOI] [PubMed] [Google Scholar]
  • 21.Mori Y., Jilkine A., Edelstein-Keshet L. Wave-pinning and cell polarity from a bistable reaction-diffusion system. Biophys. J. 2008;94(9):3684–3697. doi: 10.1529/biophysj.107.120824. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 22.Nandan A., Koseska A. Non-asymptotic transients away from steady states determine cellular responsiveness to dynamic spatial-temporal signals. PLoS Comput. Biol. 2023;19(8) doi: 10.1371/journal.pcbi.1011388. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 23.Vastano J.A., Pearson J.E., Horsthemke W., et al. Chemical pattern formation with equal diffusion coefficients. Phys. Lett. A. 1987;124(6):320–324. [Google Scholar]
  • 24.Yochelis A., Tintut Y., Demer L.L., et al. The formation of labyrinths, spots and stripe patterns in a biochemical approach to cardiovascular calcification. New J. Phys. 2008;10(5):78–106. [Google Scholar]
  • 25.Sewalt L., Doelman A. Spatially periodic multipulse patterns in a generalized klausmeier–gray–scott model. SIAM J. Appl. Dyn. Syst. 2017;16(2):1113–1163. doi: 10.1137/16M1078756. [DOI] [Google Scholar]
  • 26.Butler T., Reynolds D. Predator-prey quasicycles from a path-integral formalism. Phys. Rev. E. 2009;79:032901. doi: 10.1103/PhysRevE.79.032901. [DOI] [PubMed] [Google Scholar]
  • 27.Butler T., Goldenfeld N. Robust ecological pattern formation induced by demographic noise. Phys. Rev. E. 2009;80:030902. doi: 10.1103/PhysRevE.80.030902. [DOI] [PubMed] [Google Scholar]
  • 28.Freidlin M.I., Wentzell A.D. Random perturbations of dynamical systems. Discrete Contin. Dyn. Syst. Ser. A. 2012;3(4):457–476. [Google Scholar]
  • 29.Ventsel’ A.D., Freidlin M.I. On small random perturbations of dynamical systems. Russ. Math. Surv. 1970;25(1):R01. [Google Scholar]
  • 30.Wales D.J. Rearrangements of 55-atom Lennard-Jones and (C60)55 clusters. J. Chem. Phys. 1994;101(5):3750–3762. [Google Scholar]
  • 31.Doye J.P.K., Wales D.J. Surveying a potential energy surface by eigenvector-following. Z. Phys. D. 1997;40(1):194–197. [Google Scholar]
  • 32.Mehta D. Finding all the stationary points of a potential-energy landscape via numerical polynomial-homotopy-continuation method. Phys. Rev. E. 2011;84:025702. doi: 10.1103/PhysRevE.84.025702. [DOI] [PubMed] [Google Scholar]
  • 33.Farrell P.E., Birkisson Á., Funke S.W. Deflation techniques for finding distinct solutions of nonlinear partial differential equations. SIAM J. Sci. Comput. 2015;37(4):A2026–A2045. [Google Scholar]
  • 34.Krause A.L., Klika V., Woolley T.E., et al. From one pattern into another: Analysis of turing patterns in heterogeneous domains via WKBJ. J. R. Soc. Interface. 2020;17(162) doi: 10.1098/rsif.2019.0621. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 35.Yin J., Wang Y., Chen J.Z.Y., et al. Construction of a pathway map on a complicated energy landscape. Phys. Rev. Lett. 2020;124(9):090601. doi: 10.1103/PhysRevLett.124.090601. [DOI] [PubMed] [Google Scholar]
  • 36.Yin J., Yu B., Zhang L. Searching the solution landscape by generalized high-index saddle dynamics. Sci. China Math. 2021;64(8):1801–1816. [Google Scholar]
  • 37.Yin J., Zhang L., Zhang P. High-index optimization-based shrinking dimer method for finding high-index saddle points. SIAM J. Sci. Comput. 2019;41(6):A3576–A3595. [Google Scholar]
  • 38.Yin J., Huang Z., Zhang L. Constrained high-index saddle dynamics for the solution landscape with equality constraints. J. Sci. Comput. 2022;91(2):62. [Google Scholar]
  • 39.Yin J., Jiang K., Shi A.-C., et al. Transition pathways connecting crystals and quasicrystals. Proc. Natl. Acad. Sci. 2021;118(49) doi: 10.1073/pnas.2106230118. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 40.K.-c. Chang, Infinite Dimensional Morse Theory, Birkhäuser Boston, Boston, MA, pp. 1–82.
  • 41.Solimini S. Morse index estimates in min-max theorems. Manuscr. Math. 1989;63(4):421–453. [Google Scholar]
  • 42.Milnor J.W. Princeton University Press; 1963. Morse Theory. [Google Scholar]
  • 43.Audin M., Damian M., Erné R. Vol. 2. Springer; 2014. Morse Theory and Floer Homology. [Google Scholar]
  • 44.Schnakenberg J. Simple chemical reaction systems with limit cycle behaviour. J. Theor. Biol. 1979;81(3):389–400. doi: 10.1016/0022-5193(79)90042-0. [DOI] [PubMed] [Google Scholar]
  • 45.Xu C., Wei J. Hopf bifurcation analysis in a one-dimensional schnakenberg reaction–diffusion model. Nonlinear Anal. Real World Appl. 2012;13(4):1961–1977. [Google Scholar]
  • 46.Hao W., Xue C. Spatial pattern formation in reaction–diffusion models: A computational approach. J. Math. Biol. 2020;80(1):521–543. doi: 10.1007/s00285-019-01462-0. [DOI] [PubMed] [Google Scholar]
  • 47.Sarfaraz W., Madzvamuse A. Classification of parameter spaces for a reaction-diffusion model on stationary domains. Chaos Solitons Fractals. 2017;103:33–51. [Google Scholar]
  • 48.Krause A.L., Gaffney E.A., Maini P.K., et al. Modern perspectives on near-equilibrium analysis of turing systems. Philos. Trans. R. Soc. A Math Phys Eng Sci. 2021;379(2213) doi: 10.1098/rsta.2020.0268. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 49.Madzvamuse A., Barreira R. Domain-growth-induced patterning for reaction-diffusion systems with linear cross-diffusion. Discrete Contin. Dyn. Syst. B. 2018;23(7):2775–2801. [Google Scholar]
  • 50.Kolokolnikov T., Ward M., Wei J. Spot self-replication and dynamics for the schnakenburg model in a two-dimensional domain. J. Nonlinear Sci. 2009;19:1–56. [Google Scholar]
  • 51.Koch A.J., Meinhardt H. Biological pattern formation: From basic mechanisms to complex structures. Rev. Mod. Phys. 1994;66:1481–1507. [Google Scholar]
  • 52.Murray S.M., Sourjik V. Self-organization and positioning of bacterial protein clusters. Nat. Phys. 2017;13(10):1006–1013. [Google Scholar]
  • 53.Zhang D., Zhang C., Ouyang Q., et al. Free energy dissipation enhances spatial accuracy and robustness of self-positioned turing pattern in small biochemical systems. J. R. Soc. Interface. 2023;20(204) doi: 10.1098/rsif.2023.0276. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 54.Heymann M., Vanden-Eijnden E. The geometric minimum action method: A least action principle on the space of curves. Commun. Pure Appl. Math. 2008;61(8):1052–1117. [Google Scholar]
  • 55.Butler T., Goldenfeld N. Fluctuation-driven turing patterns. Phys. Rev. E. 2011;84:011112. doi: 10.1103/PhysRevE.84.011112. [DOI] [PubMed] [Google Scholar]
  • 56.Patti D., Lavacchi F., Arbel-Goren L., et al. Robust stochastic turing patterns in the development of a one-dimensional cyanobacterial organism. PLoS Biol. 2018;16(5):1–25. doi: 10.1371/journal.pbio.2004877. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 57.Karig D., Martini K.M., Lu T., et al. Stochastic turing patterns in a synthetic bacterial population. Proc. Natl. Acad. Sci. U.S.A. 2018;115(26) doi: 10.1073/pnas.1720770115. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 58.Biancalani T., Jafarpour F., Goldenfeld N. Giant amplification of noise in fluctuation-induced pattern formation. Phys. Rev. Lett. 2017;118:018101. doi: 10.1103/PhysRevLett.118.018101. [DOI] [PubMed] [Google Scholar]
  • 59.Patankar S.V. Series in Computational Methods in Mechanics and Thermal Sciences. 1980. Numerical heat transfer and fluid flow. [Google Scholar]
  • 60.Osher S., Chakravarthy S. High resolution schemes and the entropy condition. SIAM J. Numer. Anal. 1984;21(5):955–984. [Google Scholar]
  • 61.Bear J., Bachmat Y. Theory and Applications of Transport in Porous Media. 1990. Introduction to modeling of transport phenomena in porous media. [Google Scholar]
  • 62.Kevrekidis P.G. Vol. 232. Springer Science and Business Media; 2009. The Discrete Nonlinear Schrödinger Equation: Mathematical Analysis, Numerical Computations and Physical Perspectives. [Google Scholar]
  • 63.Diambra L., Senthivel V.R., Menendez D.B., et al. Cooperativity to increase turing pattern space for synthetic biology. ACS Synth. Biol. 2014;4(2):177–186. doi: 10.1021/sb500233u. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 64.Rajasekaran R., Chang C.-C., Weix E.W.Z., et al. A programmable reaction-diffusion system for spatiotemporal cell signaling circuit design. Cell. 2024;187(2):345–359.e16. doi: 10.1016/j.cell.2023.12.007. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 65.Scholes N.S., Schnoerr D., Isalan M., et al. A comprehensive network atlas reveals that turing patterns are common but not robust. Cell Syst. 2019;9(3):243–257. doi: 10.1016/j.cels.2019.07.007. [DOI] [PubMed] [Google Scholar]
  • 66.Kumar D., Ajayakumar A., Raha S. Stability aware spatial cut of metapopulations ecological networks. Ecol. Complex. 2021;47 [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Supplementary Data S1

Supplementary Raw Research Data. This is open data under the CC BY license http://creativecommons.org/licenses/by/4.0/

mmc1.pdf (3.9MB, pdf)

Articles from Fundamental Research are provided here courtesy of The Science Foundation of China Publication Department, The National Natural Science Foundation of China

RESOURCES