Theorem 2.4 — the product form of a closed migration process
ProvedKellyStochasticNetworks.closed_migration_equilibriumConsider a closed migration process on colonies: individuals move one at a time from colony to colony at rate
where , all , and for . Let solve the traffic equations (2.1):
Then for any non-zero constant the measure
satisfies the equilibrium equations for these rates. On the state space of a closed process with individuals, is the normalizing constant that makes a probability distribution, and is then the equilibrium distribution of the process.
The striking feature is that the joint distribution factorizes as a product over individual colonies, even though the total population is held fixed and the occupancies are therefore dependent.
Formalization Note The equilibrium equations are a local condition, one equation per state, so they are stated over all of rather than over the fixed-population subset; restricting to changes nothing, because every transition preserves . The constant is left free precisely because the equilibrium equations are homogeneous: fixing it is the separate normalization step over .
import Mathlib import Definitions.Def_KellyStochasticNetworks_Balance import Definitions.Def_KellyStochasticNetworks_Migration
namespace KellyStochasticNetworks
theorem closed_migration_equilibrium {J : ℕ} (lam : Fin J → Fin J → ℝ) (φ : Fin J → ℕ → ℝ)
(α : Fin J → ℝ) (G : ℝ) (hG : G ≠ 0)
(hlamdiag : ∀ j, lam j j = 0) (hlam : ∀ j k, 0 ≤ lam j k)
(hφ0 : ∀ j, φ j 0 = 0) (hφpos : ∀ j r, 1 ≤ r → 0 < φ j r)
(htraffic : ClosedTraffic lam α) :
FullBalance (fun n : Fin J → ℕ => G⁻¹ * ∏ j, (α j ^ n j / phiProd φ j (n j)))
(closedMigrationRates lam φ) := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.