Carrying capacity 2026-10-14
A carrying capacity is an abundance scale at which a specified environment's net population growth vanishes. In the logistic growth equation, positive unharvested populations approach . It depends on the species, resources and environment rather than being an immutable universal population limit.
The useful distinction is between a growth rate and a sustainable abundance. In a logistic differential equation, controls how quickly a population responds, while the carrying capacity sets the positive equilibrium point. Increasing with fixed accelerates approach without raising that equilibrium. Increasing changes the destination. The logistic differential equation diagrams show populations approaching the same carrying capacity from below and above.
In ecological use, the carrying capacity describes what a particular environment can support under specified conditions. Nutrient supply, available space, and accumulated waste can change those conditions; it is not a permanent property of a species alone. A population temporarily above a carrying capacity is possible. In the simplest constant- logistic growth equation, its net growth becomes negative; real population dynamics can include delays, seasonal variation, and changing resources that the basic mathematical model omits. [ref].
Logistic differential equation Created 2026-09-28 Updated 2026-10-06
The logistic differential equation has equilibria and and the nonconstant solutions
A nonlinear ordinary differential equation depends nonlinearly on the unknown function or its derivatives.
Logistic growth equation 2026-10-14
The logistic growth equation applies the logistic differential equation to population dynamics. For positive growth rate and carrying capacity , an initial condition gives , where . Its per-capita growth falls linearly with abundance, and a trajectory starting below reaches an inflection point when . The exact solutions of a differential equation and their diagrams are developed under logistic differential equation. A translated and scaled logistic function has the same form. In nonlinear regression for biological size, an analogous saturation curve need not imply that circumference itself obeys a mechanistic population law.
Logistic map Created 2026-10-03 Updated 2026-10-14
The logistic map repeatedly applies a quadratic function:
The closed interval is a positively invariant set: . An orbit is the entire resulting sequence , not just one application of the formula. For example, with and , the first states are , approaching the fixed point .
As a simple model of population dynamics, is a scaled abundance in generation . When abundance is small, is close to ; increasing abundance reduces this per-capita multiplier. The falling side of the quadratic function represents sufficiently severe crowding reducing the next generation. The scale is not generally the carrying capacity: the positive fixed point is . The logistic map is a discrete-generation model; the continuous-time logistic growth equation has a different evolution rule and does not produce its period-doubling cascade.
The practical question is how abundance behaves after the initial adjustment: does it settle, alternate, or continue varying? The same formula permits all these possibilities. The following figure shows three orbits, their cobweb plots, and a bifurcation diagram. In a cobweb plot, moving vertically to calculates the next state, and moving horizontally to makes that value the input for the next step.
Figure 1. . All three upper examples start at . At , the orbit approaches a fixed point; at and , it approaches periodic orbits of periods two and four. Filled red marks in the cobweb plots indicate an attracting fixed point, while hollow red marks indicate a repelling one. The lower bifurcation diagram retains 240 orbit states per parameter after discarding 2000 initial steps. Each column samples one orbit, rather than all possible orbits; the highlighted period-three window shows why larger parameters need not mean sensitive attracting motion. Details.
The fixed points solve :
The second fixed point is in for and coincides with zero at . The derivative is , so the fixed-point multipliers are at zero and at . The fixed point stability for an iteration test gives an attracting zero for , and a locally asymptotically stable positive fixed point for . A multiplier of modulus one needs a nonlinear argument; the strict derivative test alone settles neither nor .
This derivative test has a direct interpretation. A small error obeys
At , the leading multiplier is : the error changes sign, explaining the alternating approach, while its magnitude eventually shrinks by approximately a factor per step. At , the multiplier is , and the positive fixed point repels nearby states. However, a different outcome has asymptotic stability: the logistic map two-cycle attracts nearby orbits.
For , the attracting period-two orbit has the two values
At they are approximately and , with and . Their periodic-orbit multiplier is , so a small displacement shrinks over two steps even though the fixed point is unstable. The brief algebraic justification is to factor , remove the fixed point factors, and multiply the two derivatives using the chain rule.
At , the positive fixed-point multiplier passes through and a period-doubling bifurcation creates the period-two orbit. At , its periodic-orbit multiplier passes through and an attracting period-four periodic orbit emerges. At , the period-four values are approximately in that order. Further period-doubling bifurcations accumulate near . Beyond that value there are also parameter windows with attracting periodic orbits, including a period-three window near . Neither a crowded numerical plot nor a parameter beyond the accumulation value proves sensitive dependence on initial conditions on the attracting set.
The endpoint supplies an analytically transparent example. The homeomorphism satisfies
where is the full tent map. Thus these maps have topological conjugacy; stretching and folding in the tent map explain sensitive dependence on initial conditions and Devaney chaos for on . This does not make every individual orbit nonperiodic: stays fixed, and follows . Sensitivity means that these exceptional orbits also have arbitrarily close initial states that eventually depart substantially.
Robert M. May's "Simple mathematical models with very complicated dynamics" (1976), Nature 261, pp. 459–467, reviewed how simple deterministic recurrence relations can pass from stable abundances through period-doubling cascades to irregular behaviour. May presented the logistic map as an especially accessible example and discussed the relevance of such models to population dynamics. The paper explicitly describes itself as a review of results found by several researchers, bringing their findings together for a broad scientific audience.[ref]