Answers are grounded in this paper and cite their sources.
Proves the maximum average input limit of a leaky integrator system, highlighting connections to various fields.
We consider a discrete-time leaky integrator of the form H_n = λ Hₙ₋₁ + x_n with 0 < λ < 1, x_n ∈ {−1, 0, 1}, and a hard state constraint |H_n| ≤ K for all n. This system models a finite-capacity accumulator with exponential forgetting: past inputs decay but cannot accumulate beyond K. We prove that the long-term average input A = limsupN→∞ (1/N) Σ x_n is bounded above by A_max = ((1−λ)/(1+λ)) K, and that this bound is sharp. The proof uses the telescoping identity Σ x_n = (1−λ) Σ H_n + H_N − λ H₋₁ together with the state constraint |H_n| ≤ K. The result is equivalent to the capacity of a token-bucket regulator in communication networks. We provide a self-contained derivation and discuss analogous structures in biological, physical, and mathematical systems where finite capacity limits sustainable throughput.
No takes yet. Share an insight, caveat, or question.
Goss, Jr., Matthew J. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: