advanced33 min studyLesson 407 in Mathematics

Reaction–diffusion and traveling fronts

Reduce a Fisher–KPP wave to an ODE and distinguish an exact front, a linear tail test, and a spreading theorem.

On this page

What you’ll understand

  • Derive the traveling-wave ODE with the correct sign and end states.
  • Verify an explicit monotone Fisher front by substitution.
  • Interpret the minimal-speed condition without treating linearization as a complete existence proof.

Diffusion spreads a population while local reaction can amplify it. In the Fisher–KPP model, these mechanisms create fronts connecting a populated state to an empty one. A traveling wave converts the PDE into an ordinary differential equation, but the required conditions occur at opposite spatial infinities. The resulting problem is a global connection in phase space. A local calculation near the leading edge offers insight while remaining distinct from proof of a complete front or selection by initial data.

A moving coordinate fixes the profile and its orientation

On the real line, consider uₜ=D uₓₓ+r u(1−u), with constants D>0 and r>0. A right-moving front has u(x,t)=U(z), z=x−ct, with U approaching 1 as z tends to negative infinity and 0 as z tends to positive infinity. Substitution gives D U″+cU′+rU(1−U)=0. The profile is decreasing for the usual invasion orientation, and c is positive for motion to the right. Changing the moving-coordinate convention changes the sign in the ODE.

The scalar comparison principle keeps a solution between zero and one when its initial data lie in that range and the whole-line solution is in the appropriate bounded classical or mild class. The reaction vanishes at both endpoints and is positive between them. This invariant range helps analyze the nonlinear equation but does not determine a wave speed by itself. A wave is also translation invariant: replacing U(z) by U(z−z₀) gives the same shape at another location, so a normalization such as a chosen profile value at z=0 is additional data.

u(x,t)=U(x−ct),DU′′+cU′+rU(1−U)=0,U(−∞)=1,U(+∞)=0u(x,t)=U(x-ct),\qquad D U''+cU'+rU(1-U)=0,\qquad U(-\infty)=1,\quad U(+\infty)=0
This describes a right-moving Fisher–KPP front on ℝ with D,r>0. The end states and orientation are part of the traveling-wave problem.↔ Scroll wide equations horizontally.

Linear tails explain a speed threshold but not the entire connection

Near the leading edge U=0, replacing the reaction by rU and testing a positive exponential tail exp(−λz) gives Dλ²−cλ+r=0. Real positive tail rates require c at least 2√(Dr). For the logistic Fisher equation, the classical traveling-wave theorem indeed gives monotone fronts precisely for speeds at or above that value. The quadratic calculation motivates the threshold; existence of the nonlinear connection and exclusion of inadmissible profiles require a separate phase-plane or PDE argument.

Wave existence is not the same question as speed selection from an initial profile. For nontrivial continuous compactly supported initial data between zero and one, Fisher–KPP spreading has the minimal asymptotic speed. Other tail behaviors can lead to different selection, so a pre-existing faster traveling wave is not inconsistent with that compact-data result. At the minimal speed the tail has a repeated-root structure, and its detailed asymptotics differ from a generic faster wave. A leading exponential alone does not capture every prefactor or transient location shift.

Dλ2−cλ+r=0,c∗=2Dr,λ±=c±c2−4Dr2D(c>c∗)D\lambda^2-c\lambda+r=0,\qquad c_*=2\sqrt{Dr},\qquad \lambda_\pm=\frac{c\pm\sqrt{c^2-4Dr}}{2D}\quad(c>c_*)
The tail calculation is a linearized diagnostic. For the logistic scalar Fisher equation the stated threshold matches the full monotone-front theorem, which needs additional nonlinear reasoning.↔ Scroll wide equations horizontally.

An explicit wave is a strong check with a limited conclusion

For D=r=1, a particular profile is U(z)=(1+exp(z/√6))⁻² with speed 5/√6. It has the correct end states and is strictly decreasing. Differentiating and substituting verifies the ODE everywhere, giving an exact solution rather than a plot-based guess. Its speed is slightly greater than two, so this explicit profile is not the minimal-speed wave. The fact that a formula is available at one speed does not establish uniqueness or a closed formula for all other speeds.

Front models require attention to domain and mechanism. A finite interval with prescribed endpoints is a different problem from a connection at spatial infinities. Spatially varying coefficients, bistable reactions, or nonlocal diffusion can change thresholds and qualitative propagation. Linear heat smoothing alone has no logistic saturation, and a sigmoid gate alone has no spatial evolution. Use a profile instrument to inspect shape and an actual PDE theorem to justify motion; neither a smooth animation nor a linear tail fit proves long-time selection.

Verify a nonlinear wave for every coordinate

Verify U(z)=(1+e^(z/√6))⁻² for the unit-coefficient Fisher equation at c=5/√6.

  1. Write y=e^(z/√6)>0. Differentiation gives U′=−2y/[√6(1+y)³] and U″=y(2y−1)/[3(1+y)⁴].

  2. The other ODE terms are cU′=−5y(1+y)/[3(1+y)⁴] and U(1−U)=y(2+y)/(1+y)⁴.

  3. Their common numerator is y[(2y−1)−5(1+y)+3(2+y)]/3=0. Also U′<0, U(−∞)=1, U(+∞)=0, and U(0)=1/4.

The result

The substitution verifies the full nonlinear traveling-wave equation and both end states. It proves this exact front exists at 5/√6, without identifying it as the minimal-speed front.

Explore the model

Interactive lab

Interactive lab · network

Inspect a normalized front profile through a sigmoid

Reset, set weight w=−1 and input x=−0.5. The fixed-bias sigmoid gives output 0.5; square it to predict front value 0.25 at z=0. For a fresh run, Reset, set w=−1 and x=0.5: output is 1/(1+e), giving squared profile about 0.0723 at z=√6. Here x=z/√6−0.5 compensates the fixed bias. This gate computes profile values, not front motion or a PDE solution.

Inspect a normalized front profile through a sigmoidOne inspectable sigmoid unit, σ(wx − 0.5). Playback traces the computation graph. There is no training, attention mechanism or hidden deep network. Current readings: Product · wx: 1.2; Logit · wx − 0.5: 0.7; Sigmoid output: 0.6682. All parameters are adjustable with the labeled controls below.One input. One weight. One sigmoid.x1.20× w1.20+ b0.70σ0.668output0.668w = 1.00b = −0.50σ(z) = 1 / (1 + exp(−z))
Computation graphSignal trace
Product · wx
1.2
Logit · wx − 0.5
0.7
Sigmoid output
0.6682
t = 0 s

One inspectable sigmoid unit, σ(wx − 0.5). Playback traces the computation graph. There is no training, attention mechanism or hidden deep network. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forAn explicit nonlinear profile can be checked pointwise without mistaking a sigmoid instrument for a reaction–diffusion simulator.

Check your understanding

What does the linearized exponential-tail calculation alone establish?

Try it yourself

For D=r=1 and c=3, calculate the two linearized positive tail rates. Compare with c=1 and explain what this says, and does not say, about a monotone nonnegative Fisher front.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Use the discriminant c²−4 and distinguish the tail equation from the complete nonlinear boundary-value problem.

Compare with the solution

At c=3 the rates are (3±√5)/2, both positive. At c=1 the roots are nonreal, which is incompatible with the usual nonoscillatory positive leading tail. The full logistic-front theorem confirms that monotone fronts require c≥2. The positive rates at c=3 are local candidates, not a stand-alone construction of a profile satisfying both conditions at infinity. Such a profile exists by the nonlinear theorem, not merely because the quadratic has roots.

Take it with you

  • Traveling waves require a moving-coordinate sign convention and two asymptotic states.
  • A local tail threshold and a global nonlinear front theorem are different arguments.
  • Existence at one speed does not determine selection from arbitrary initial data.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.