The family-size process: traffic equations and the mean number of families
ProvedKellyStochasticNetworks.family_size_trafficKendall's family-size process is an open migration process with infinitely many colonies: colony holds the families of size , and is the number of such families. An immigrant founds a new family of size at rate ; within a family of size each individual gives birth at rate and dies at rate , so a family moves from colony to colony at rate and to colony at rate ; a family of size that loses its member becomes extinct and leaves the system at rate . In migration notation this is with , for , and .
Let and , and set
Then three things hold.
- The traffic equation at colony : .
- The traffic equation at each colony :
- The series converges, with
Because gives , the equilibrium numbers of families of each size are independent Poisson variables of means , so the third identity is the mean of the total number of distinct families. The condition is the stability condition, and it is exactly what makes the series converge.
Formalization Note Colonies are indexed by the positive integers, so the statements are written at , and to keep every index positive and avoid truncated subtraction. Convergence of the series and the value of its sum are asserted together.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Migration
namespace KellyStochasticNetworks
theorem family_size_traffic (lam mu nu : ℝ) (hlam : 0 < lam) (hmu : lam < mu) (hnu : 0 < nu)
(α : ℕ → ℝ)
(hα : ∀ j : ℕ, α (j + 1) = nu / (lam * ((j : ℝ) + 1)) * (lam / mu) ^ (j + 1)) :
α 1 * (mu + lam) = nu + α 2 * (2 * mu)
∧ (∀ i : ℕ, α (i + 2) * (((i : ℝ) + 2) * lam + ((i : ℝ) + 2) * mu)
= α (i + 1) * (((i : ℝ) + 1) * lam) + α (i + 3) * (((i : ℝ) + 3) * mu))
∧ HasSum (fun j : ℕ => α (j + 1)) (-(nu / lam) * Real.log (1 - lam / mu)) := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.