---
title: Logistic Branching Process
url: https://www.emergentmind.com/topics/logistic-branching-process
type: topic
---

# Logistic Branching Process

The logistic branching process is a density-dependent branching model in which linear reproduction is counterbalanced by a quadratic competition term, so that growth is supercritical at low density and suppressed at high density. In a standard continuous-time birth–death formulation, a population of size \(i\) gives birth at rate \(b\,i\) and dies at rate \(d\,i+c\,i(i-1)\); in large-population scalings the competition coefficient is replaced by \(c/N\), yielding a typical equilibrium size of order \(N\). The same mechanism appears in discrete-time branching models with carrying capacity, in Feller diffusions with logistic drift, in continuous-state branching processes with quadratic competition, and in spatial and multitype systems whose genealogies exhibit both classical and multiple-merger coalescent limits [1310.5766][2509.05217][2111.06147].

## 1. Canonical formulations

A basic logistic branching process is a continuous-time Markov chain on \(\mathbb Z_+\) with transition rates
\[
q_{i,i+1}=b\,i,\qquad q_{i,i-1}=d\,i+c\,i(i-1),
\]
or, equivalently,
\[
L f(i)= b\,i\bigl[f(i+1)-f(i)\bigr]+\bigl(d\,i+c\,i(i-1)\bigr)\bigl[f(i-1)-f(i)\bigr].
\]
Here births are linear in the current population size, whereas competition contributes a quadratic death term. This model has been proposed for numbers of individuals in populations competing for some resource, and also for numbers of species [1310.5766].

In the large-carrying-capacity setting used for genealogical limits, one writes \(X_t^N\in\{0,1,2,\dots\}\) and
\[
(\mathcal L^N f)(n)
=
n\lambda\bigl[f(n+1)-f(n)\bigr]
+
n\mu\bigl[f(n-1)-f(n)\bigr]
+
\frac{c}{N}n(n-1)\bigl[f(n-1)-f(n)\bigr].
\]
The logistic regulation is then the term \(\frac{c}{N}n(n-1)\): each ordered pair of individuals contributes to density-dependent mortality at rate \(c/N\). At the deterministic level,
\[
\frac{d}{dt}E[X_t^N]
\approx
(\lambda-\mu)E[X_t^N]-\frac{c}{N}E[X_t^N]^2,
\]
so the carrying-capacity scale is
\[
K_N\approx \frac{N(\lambda-\mu)}{c}.
\]
This formulation makes explicit that the equilibrium population size is of order \(N\) [2509.05217].

The literature also uses discrete-time analogues. In population-size-dependent branching processes, individuals reproduce i.i.d. according to an offspring law \(\xi(z)\) that depends on the current population size \(z\), with mean \(m(z)\). Logistic behavior is encoded by choosing \(m(z)>1\) for \(z<K\) and \(m(z)<1\) for \(z>K\). Two standard examples are Beverton–Holt,
\[
m(z)=\frac{2K}{K+z},
\]
and Ricker,
\[
m(z)=r^{1-z/K},\qquad r>1.
\]
Equivalent deterministic-control branching processes encode the same mean through a control function \(\phi(z)=z\,m(z)\) when \(m̃=1\) [2308.01150].

| Setting | State space | Logistic mechanism |
|---|---|---|
| Birth–death chain | \(\mathbb Z_+\) | death rate \(d\,i+c\,i(i-1)\) |
| Large-\(N\) chain | \(\mathbb Z_+\) | death rate \(\mu n+\frac{c}{N}n(n-1)\) |
| Feller diffusion | \([0,\infty)\) | drift \(\theta X_t-\gamma X_t^2\) |
| Logistic CSBP | \([0,\infty]\) | generator term \(-\frac c2 z^2 f'(z)\) |

## 2. Deterministic, diffusion, and pathwise limits

For the continuous-time birth–death process with carrying capacity parameter \(K\), the rescaled population \(X_K(t)=N_K(t)/K\) converges, as \(K\to\infty\), to the deterministic logistic equation
\[
\frac{dx}{dt}=r\,x(1-x),\qquad r=b-d.
\]
This law-of-large-numbers regime isolates the macroscopic carrying-capacity effect and suppresses stochastic fluctuations [2012.13382].

A diffusion-scale version is Feller’s branching diffusion with logistic growth,
\[
dX_t=\sigma\sqrt{X_t}\,dW_t+(\theta X_t-\gamma X_t^2)\,dt.
\]
This process admits a Ray–Knight representation in terms of a reflected Brownian motion \(H\) whose drift is affine linear in the local time accumulated at its current level. In one formulation,
\[
dH_s=\frac{2}{\sigma}\,dB_s+\frac{2\theta}{\sigma^2}\,ds-\gamma\,L_s(H_s)\,ds+d\!\left(\frac12 L_s(0)\right),
\]
and the stopped local-time profile \((\sigma^2/4)L_{S_x}(t;H)\) has the law of the logistic diffusion started from \(x\). The microscopic interpretation uses a “pecking order”: when contemporaries compete, the left-most wins and the right-most dies, which turns competition into a local-time drift in the exploration process [1305.1202][1305.1207].

Lamperti-type representations extend this picture. In a Brownian environment,
\[
dZ_t=a\,Z_t\,dt-c\,Z_t^2\,dt+\sigma\,Z_t\,dB_t
\]
is put in one-to-one correspondence with a generalized Ornstein–Uhlenbeck process \(R\) through a random time change. For logistic continuous-state branching processes with quadratic competition, a generalized Ornstein–Uhlenbeck process again underlies the construction, now combined with branching mechanisms of Lévy–Khintchine type. These pathwise representations are central in extinction, conditioning, and boundary analyses because they transfer questions about the branching process to one-dimensional diffusions or time-changed Lévy-driven dynamics [1906.01395][2408.14993].

## 3. Extinction, quasi-stationarity, and conditioned dynamics

A basic feature of the classical logistic birth–death process is that the absorbing state \(0\) is reached almost surely in finite time, even when the intrinsic growth rate \(r=b-d\) is positive. The quadratic death term dominates at high densities, makes the chain non-explosive, and nevertheless forces eventual extinction. This sharply distinguishes logistic branching from supercritical linear branching, where positive growth can sustain survival with positive probability [1310.5766].

Conditioning on non-extinction therefore becomes a central object. For survival up to a fixed time \(T\), the process admits a finite-time \(h\)-transform based on a Wright–Fisher-type diffusion \(p_t\) with
\[
dp_t=\bigl(s\,p_t(1-p_t)-\mu\,p_t\bigr)\,dt+\sqrt{\sigma^2 p_t(1-p_t)}\,dW_t,\qquad p_0=1,
\]
and
\[
h(i,t)=\mathbb P(Z_T>0\mid Z_t=i)=\mathbb E\bigl[1-(1-p_{T-t})^i\bigr].
\]
The conditioned jump rates are
\[
q^T_{k,k+1}(t)=q_{k,k+1}\frac{h(k+1,t)}{h(k,t)},\qquad
q^T_{k,k-1}(t)=q_{k,k-1}\frac{h(k-1,t)}{h(k,t)}.
\]
The Yaglom law is described through the generating function \(G(\theta)=\sum_{k\ge1}\pi(k)\theta^k\), which solves
\[
c\,\theta(1-\theta)\,G''(\theta)+(d-b\theta)(1-\theta)\,G'(\theta)+a\,G(\theta)=a
\]
with \(G(0)=0\), \(G(1)=1\), and \(a=d\,\pi(1)\). As \(T\to\infty\), the conditioned process converges to a \(Q\)-process with time-homogeneous rates \(q^*_{k,k\pm1}\); this \(Q\)-process is positive recurrent and reversible, and its time reversal supports an explicit joint generator for total population size and sample genealogy [1310.5766].

For logistic continuous-state branching processes, the conditioning problem takes a different form. Under suitable assumptions, extinction is equivalent to finiteness of the total progeny
\[
J=\int_0^\infty Z_s\,ds.
\]
Conditioning on non-extinction is implemented by requiring \(J\) to exceed arbitrarily large exponential random variables, which leads to a Doob \(h\)-transform with an explicit excessive function \(h\). The conditioned process superposes the original logistic branching dynamics with a density-dependent immigration term, but it still has finite lifetime almost surely: depending on the logarithmic moment of the Lévy measure, the lifetime is either a killing time or a continuous explosion time [2408.14993].

Boundary classification for logistic continuous-state branching with competition is controlled by dual diffusions \(U\) and \(V\), defined by
\[
dU_t=\sqrt{c\,U_t}\,dB_t-\Psi(U_t)\,dt,\qquad
dV_t=\sqrt{c\,V_t}\,dB_t+\bigl(c/2+\Psi(V_t)\bigr)\,dt.
\]
Laplace duality \(Z\leftrightarrow U\) and Siegmund duality \(U\leftrightarrow V\) yield criteria for extinction, explosion, regular reflection at \(\infty\), and the law of the local time accumulated at \(\infty\) [2111.06147].

## 4. Genealogies and coalescent limits

The genealogical analysis of logistic branching has recently become precise in the large-equilibrium regime. For the scaled process with typical size of order \(N\), one samples a fixed number of individuals and traces their ancestry backward after the time acceleration
\[
t^{(N)}=t\times \frac{c}{\lambda-\mu}N.
\]
The limit depends on the tail of the offspring distribution, equivalently on the probability that a single individual produces many surviving offspring in a short time interval [2509.05217].

The proof uses a modified lookdown construction. Individuals are assigned levels \(1,2,3,\dots\); for each pair of levels \((i,j)\) there is a Poisson clock of rate \(c/N\), and when it rings one occupied level dies, encoding logistic death. Births from level \(i\) occur as Poisson processes, individuals at levels above a random insertion point are pushed upward, and a new individual is inserted. Tightness of empirical measures, identification of the limiting martingale problem, and control of large birth sweeps then determine the ancestral partition limit [2509.05217].

Three regimes emerge. If the offspring distribution has finite second moment, the ancestral process converges to the Kingman coalescent, with only pairwise mergers surviving. If the tail is regularly varying with index \(\alpha\in(1,2)\),
\[
\Pr\{\text{a birth creates}>k\text{ offspring}\}\sim L(k)\,k^{-\alpha},
\]
the limit is the \(\mathrm{Beta}(2-\alpha,\alpha)\) coalescent with
\[
\Lambda(dx)=\frac{1}{\mathrm B(2-\alpha,\alpha)}x^{1-\alpha}(1-x)^{\alpha-1}\,dx.
\]
At the boundary case \(\alpha=1\), the limit is the Bolthausen–Sznitman coalescent, corresponding to \(\Lambda(dx)=\mathbf 1_{(0,1)}(x)\,dx\). In all three cases the merger rates are
\[
\lambda_k=\int_0^1 x^{k-2}(1-x)\,\Lambda(dx),\qquad k\ge2,
\]
and the partition-valued genealogy converges in \(D([0,\infty),\mathcal P_n)\) [2509.05217].

These results correct a common simplification. Logistic regulation stabilizes the population size around a carrying capacity of order \(N\), and classical neutral reasoning would therefore suggest Kingman genealogies; however, if reproduction is sufficiently bursty, multiple mergers survive the large-\(N\) limit. The predicted genetic signatures include an excess of very short internal branches and high-frequency derived variants [2509.05217].

Related genealogical limits appear in other logistic regimes. If one samples while a density-dependent branching population is still growing superlinearly, the coalescent tree converges to that of a density-independent supercritical branching process, yielding a limiting tree that is universal over exponential, logistic, and Gompertz-type growth models [2012.13382]. In two-type logistic branching with mutation and selection, the near-capacity regime converges to a Gillespie–Wright–Fisher diffusion, and the corresponding backward object is an Ancestral Selection Graph whose lineage-counting process is the moment dual of the limiting diffusion [2507.12601].

## 5. Multitype and spatial generalizations

In the two-type logistic model with selection, the state is \(N_K(t)=(N_K^+(t),N_K^-(t))\), births are governed by type-specific offspring measures \(\mu_K^\pm\), mutations occur at rates \(\theta^\pm/K\), and each individual suffers logistic death proportional to the total population divided by \(K\). After rescaling by \(K\) in space and time, the frequency process converges to a Wright–Fisher-type SDE with selection and mutation. In the simplified case \(v^+=v^-=:v\) and \(\theta^-=0\),
\[
dW(t)=s\,W(t)(1-W(t))\,dt+\sqrt{2\gamma\,W(t)(1-W(t))}\,dB(t),
\]
and the backward lineage count \(A(t)\) has generator
\[
\mathcal L_{\mathrm{dual}}f(n)=s\,n[f(n+1)-f(n)]+(\mathfrak m+v)\binom{n}{2}[f(n-1)-f(n)].
\]
The moment duality is
\[
E_w[W(t)^n]=E_n[w^{A(t)}].
\]
This gives a direct connection between logistic population regulation, selection, and ancestral branching–coalescing structure [2507.12601].

A mean-field spatial logistic branching system on \(\{1,\dots,N\}\) carries particles that reproduce at rate \(s\), die logistically at rate \(d\,k(k-1)\) at a site with \(k\) particles, and migrate at rate \(c\). Starting from a single particle, one obtains two time windows: an initial collision-free phase described by a Crump–Mode–Jagers process of colonies, and an emergence–equilibration window at time \(\alpha^{-1}\log N+O(1)\), when the occupied-site density becomes order \(N\). In the associated Fisher–Wright diffusion with rare mutation, this particle system appears as a dual genealogical structure, so that the logistic branching model and the selected diffusion are, in the paper’s phrase, “two sides of the very same coin” [1007.5462].

Spatial logistic branching on lattices exhibits hydrodynamic and fluctuation limits. In the weak-competition regime \(c\to0\), the rescaled density field
\[
u^c(t,z)=c\,\eta_{c^{-2}t}(\lfloor c^{-1}z\rfloor)
\]
converges to the Fisher–Kolmogorov–Petrovsky–Piskunov equation
\[
\partial_t u=\Delta u+u-\kappa u^2,
\]
and the non-equilibrium fluctuation field converges to a generalized Ornstein–Uhlenbeck process with deterministic heterogeneous coefficients [2409.05269]. For ancestral lineages in time-reversed logistic branching random walks, a quenched central limit theorem holds in a high-density regime, established through coarse graining, regeneration times, and coupling arguments [2403.08567]. In two dimensions, the pair-coalescence time of two ancestral lineages sampled from the stationary regime scales like \(N^2\log N\), matching the asymptotics of the stepping-stone model and recovering Malécot’s continuous-space formula for identity by descent [2405.02090].

## 6. Model comparison and extinction-time asymptotics

Logistic growth can be encoded either through population-size-dependent offspring laws or through controlled branching. For deterministic-control branching processes, exact equivalence with a population-size-dependent branching process holds if and only if a divisibility condition is satisfied: for each
\[
y_z:=z/\gcd(\phi(z),z),
\]
the offspring law \(\tilde \xi\) must be \(y_z\)-divisible. In particular, equivalence holds when \(\tilde \xi\) is infinitely divisible, such as Poisson or Negative-Binomial, or when \(\phi(z)/z\in\mathbb N\) for all relevant \(z\). Even without exact equivalence, first and second moments can be matched by
\[
z\,m(z)=m̃\,\phi(z),\qquad z\,\sigma^2(z)=\sigmã^2\,\phi(z),
\]
and under regularity assumptions the one-step total-variation distance is bounded by \(C/\sqrt z\), with finite-horizon path laws becoming asymptotically indistinguishable as the initial population grows [2308.01150].

For the logistic birth–death process on \(\{0,1,\dots,n\}\) with
\[
\lambda_n(x)=r_n x(1-x/n),\qquad \mu_n(x)=x,
\]
the extinction time \(\tau_n\) admits a full asymptotic classification. Subcritical regimes yield classical branching-process extinction laws, linear-diffusive scaling, or Gumbel limits depending on the size of \(r_n-1\) and the initial condition. Critical regimes lead to the diffusion limit
\[
dY=(C\,Y-Y^2)\,dt+\sqrt{2Y}\,dB_t,
\]
with \(\tau_n/\sqrt n\) converging to the hitting time of \(0\). Supercritical regimes split into a threshold regime, where there is a positive limiting chance of rapid extinction before reaching the endemic level, and a metastable regime, where the chain approaches \(x_n^*\approx n(1-1/r_n)\) and then survives for an exponentially long time. In that metastable regime,
\[
E[\tau_n]\sim \sqrt{2\pi}\,V_n\,(r_n/C_n)\,\exp[n\,V^+(r_n)],
\qquad
V^+(r)=r\ln r+1/r-1,
\]
and
\[
\tau_n/E[\tau_n]\Rightarrow \mathrm{Exp}(1)
\]
[1805.08339].

Taken together, these results show that “logistic branching process” names a broad class of density-regulated branching models rather than a single canonical process. Across discrete, diffusion, continuous-state, multitype, and spatial settings, the common structural feature is quadratic competition; the main differences lie in scaling, state space, and genealogical regime. A plausible implication is that the appropriate logistic model is determined less by the word “logistic” itself than by the intended asymptotic question: carrying-capacity approximation, extinction and quasi-stationarity, diffusion approximation, or ancestral structure.

Source: https://www.emergentmind.com/topics/logistic-branching-process