--- title: Binomial Maps in Finite-Population Dynamics url: https://www.emergentmind.com/topics/binomial-maps type: topic --- # Binomial Maps in Finite-Population Dynamics Searching arXiv for papers directly relevant to “Binomial Maps” and closely related uses of the term. Binomial maps are stochastic finite-population counterparts of deterministic discrete-time population maps in which the deterministic update is interpreted as a conditional mean and the realized next state is sampled from an integer-valued distribution, binomial in the bounded case and Poisson in the unbounded limit [2508.11974]. The same expression, or closely related “binomial map” language, also appears in other mathematical settings: in combinatorics on words it refers to the subsequence-count map \(u\mapsto \bigl(\binom{u}{v}\bigr)_{|v|\le k}\) underlying \(k\)-binomial equivalence and \(k\)-binomial complexity [1812.07330], while in integrable systems it occurs through Yang–Baxter maps built from binomial Lax matrices \(L(\zeta)=X-\zeta A\) [1106.0214]. The term is therefore context-dependent, but in each usage it denotes a structured transformation governed by binomial sampling, binomial subsequence counts, or first-degree “binomial” matrix polynomials. ## 1. Finite-population formulation in discrete-time dynamics In population dynamics, the starting point is a deterministic map \[ \mathbf{X}(t+1)=\mathbf{f}(\mathbf{X}(t),\Theta), \] where \(\mathbf{X}(t)\) is the state vector at time \(t\), each component represents an average population or abundance, and \(\Theta\) denotes model parameters. Such maps include the Logistic, Ricker, Beverton–Holt, and Nicholson–Bailey models. Their deterministic character is defensible in an infinite-population or continuum limit, because fluctuations are negligible relative to the mean, but it is ill-suited to finite populations, where counts are integer-valued, fluctuations can be large at small population size, and extinction can occur purely from chance [2508.11974]. The construction of a Binomial map introduces an availability vector \[ \mathbf{A}_t=\boldsymbol{\phi}(\mathbf{X}(t),\Theta), \] whose components \(A_{i,t}\) represent maximal available counts, slots, or agents for component \(i\). The stochastic state \(\mathbf{X}_b(t)\) has nonnegative integer components, and the key modeling assumption is that \(\mathbf{X}_b(t)\) determines only the conditional mean of \(\mathbf{X}_b(t+1)\), not the next state exactly. For component \(i\), \[ \mathbb{E}[X_{b,i}(t+1)\mid \mathbf{X}_b(t)] = f_i(\mathbf{X}_b(t),\Theta), \] and \[ X_{b,i}(t+1)\mid \mathbf{X}_b(t)\sim \mathrm{Binomial}\!\left(A_{i,t},\,\frac{f_i(\mathbf{X}_b(t),\Theta)}{A_{i,t}}\right), \] provided \[ 0\le f_i(\mathbf{X}_b(t),\Theta)\le A_{i,t}. \] This yields a state-dependent transition kernel on nonnegative integers. If components are sampled independently conditional on the current state, the full transition kernel factors across components. The mean is fixed by the original deterministic map, while the variance emerges from finite sampling: \[ \operatorname{Var}(X_{b,i}(t+1)) = f_i(\mathbf{X}_b(t),\Theta)\left(1-\frac{f_i(\mathbf{X}_b(t),\Theta)}{A_{i,t}}\right). \] The corresponding relative fluctuation size is \[ \sigma_{\mathrm{rel}} = \sqrt{\frac{1-f_i(\mathbf{X}_b(t),\Theta)/A_{i,t}}{f_i(\mathbf{X}_b(t),\Theta)}}. \] Thus the noise amplitude is not imposed exogenously; it is generated by Bernoulli or binomial sampling and decreases relative to the mean as population scale grows. A central conceptual distinction is between demographic and environmental stochasticity. Demographic stochasticity is internal noise arising from the discreteness and chance behavior of individuals; environmental stochasticity is external noise produced by weather variation, resource shocks, or habitat disturbances. The finite-population Binomial-map construction is designed to model the former, not merely to add a random perturbation to a deterministic recurrence. Additive or externally imposed noise can model environmental variation, but it does not automatically preserve integer states, state-dependent variance, or the correct large-population scaling for demographic noise. ## 2. Agent-based interpretation and canonical examples A major feature of the Binomial-map formalism is that it makes the connection to agent-based models explicit. If component \(i\) has \(A_{i,t}\) available individuals or sites and each becomes a success at time \(t+1\) with the same probability \(p_{i,t}\), then \[ X_{b,i}(t+1)\sim \mathrm{Binomial}(A_{i,t},p_{i,t}). \] Consistency with the deterministic map requires \[ p_{i,t}=\frac{f_i(\mathbf{X}_b(t),\Theta)}{A_{i,t}}. \] The Binomial map is therefore a coarse-grained agent-based model with exchangeable Bernoulli trials, identical individuals within each component, conditional independence given the current state, and a deterministic update law specifying the conditional mean [2508.11974]. The bounded prototype in the paper is the Logistic map \[ X_{t+1}=\mu X_t\left(1-\frac{X_t}{K}\right), \] where \(K\) is the carrying capacity. Since the population cannot exceed \(K\), one takes \(A_t=K\), giving \[ \mathbb{E}[X_b(t+1)\mid X_b(t)] = \mu X_b(t)\left(1-\frac{X_b(t)}{K}\right), \] and \[ X_b(t+1)\mid X_b(t) \sim \mathrm{Binomial}\!\left( K,\, \frac{\mu X_b(t)\left(1-\frac{X_b(t)}{K}\right)}{K} \right). \] In fraction form \(x_t=X_b(t)/K\), the mean-field update is \(x_{t+1}\approx \mu x_t(1-x_t)\) for large \(K\). The unbounded prototype is the Ricker map \[ X_{t+1}=X_t\exp\!\left[\mu\left(1-\frac{X_t}{C}\right)\right]. \] Here there is no finite upper bound, so the availability is effectively infinite. Taking the limit \(A_t\to\infty\) and using the standard Poisson limit of the binomial, \[ \mathrm{Binomial}(A,\lambda/A)\Longrightarrow \mathrm{Poisson}(\lambda), \] one obtains the Poisson-map counterpart \[ \mathbb{E}[X_b(t+1)\mid X_b(t)] = X_b(t)\exp\!\left[\mu\left(1-\frac{X_b(t)}{C}\right)\right], \] \[ X_b(t+1)\mid X_b(t) \sim \mathrm{Poisson}\!\left( X_b(t)\exp\!\left[\mu\left(1-\frac{X_b(t)}{C}\right)\right] \right). \] These two examples delimit the bounded and unbounded regimes. In bounded state spaces, binomial sampling is natural because there is a finite maximum number of possible successes at each step. In unbounded state spaces, the same construction passes to a Poisson law. This suggests a unified finite-population interpretation of familiar iterated maps without leaving the discrete-time setting. ## 3. Deterministic recovery and the Jensen-gap obstruction Binomial maps recover deterministic behavior only asymptotically. Relative fluctuations vanish when expected population and capacity become large, so trajectories concentrate around the deterministic update in a law-of-large-numbers sense. For the Logistic map this occurs as \(K\to\infty\); for the Ricker map it occurs as the population scale set by \(C\) grows [2508.11974]. At finite size, however, the deterministic map is not generally the same as the mean stochastic trajectory. If \[ X(t+1)=f(X(t),\Theta) \] and the deterministic and stochastic systems start from the same initial condition \(X_0\), then at one time step \[ X(1)=f(X_0)=\mathbb{E}[X_b(1)]. \] At the next step, \[ X(2)=f(\mathbb{E}[X_b(1)]), \qquad \mathbb{E}[X_b(2)]=\mathbb{E}[f(X_b(1))]. \] For nonlinear \(f\), these are not equal in general. The discrepancy is the Jensen gap \[ \delta J=f(\mathbb{E}[X_b])-\mathbb{E}[f(X_b)]. \] For analytic \(f\), \[ \mathbb{E}[f(X_b)] = \sum_{n=0}^{\infty} f^{(n)}(0)\frac{\mathbb{E}[X_b^n]}{n!}, \qquad f(\mathbb{E}[X_b]) = \sum_{n=0}^{\infty} f^{(n)}(0)\frac{\mathbb{E}[X_b]^n}{n!}, \] so \[ \delta J = \sum_{n=0}^{\infty} f^{(n)}(0)\frac{\mathbb{E}[X_b]^n-\mathbb{E}[X_b^n]}{n!}. \] A sufficient condition for \(\delta J\to 0\) in the infinite-agent limit is that \[ f^{(n)}(0)\to 0 \qquad\text{for all } n\ge 2. \] All linear maps satisfy this trivially, so they are equivalent to their deterministic counterparts. The Logistic and Ricker maps satisfy the sufficient condition in their respective large-capacity limits. For \[ f(X_b)=\mu X_b-\mu\frac{X_b^2}{K}, \] one has \[ f^{(2)}(0)=-\frac{\mu}{K}, \qquad f^{(n)}(0)=0 \ \text{for } n\ge 3, \] hence \(f^{(2)}(0)\to 0\) as \(K\to\infty\). For the Ricker map, \[ f(X_b)=X_b\exp\!\left[\mu\left(1-\frac{X_b}{C}\right)\right] = e^\mu X_b\exp\!\left(-\frac{\mu X_b}{C}\right), \] and for \(n\ge 1\), \[ f^{(n)}(0)=n e^\mu\left(-\frac{\mu}{C}\right)^{n-1}, \] so \(f^{(n)}(0)\to 0\) as \(C\to\infty\) for all \(n\ge 2\). The multidimensional extension replaces ordinary derivatives by mixed partial derivatives of all orders. This non-equivalence is a central theoretical correction. It rules out the naive identification of “deterministic map = mean stochastic trajectory” except at one step or under additional conditions. ## 4. Extinction, quasi-stationarity, and finite-size effects Because Binomial maps are integer-valued and state dependent, they admit extinction without external forcing. In the Binomial Logistic map, \(X_b=0\) is absorbing: once extinct, the population remains extinct. The Poisson Ricker map can also hit zero, so extinction is possible there as well [2508.11974]. The extinction mechanism is demographic. Extinction probability is larger when the expected next population is small, and finite populations with smaller carrying capacity are therefore at greater risk. In the Logistic example, the paper reports numerically that small \(K\) produces substantial trajectory fluctuations, while large \(K\) suppresses them and the bifurcation diagram approaches that of the deterministic logistic map. The same qualitative convergence holds for the Ricker example as \(C\) increases, but unlike the deterministic recurrence, the stochastic model still allows extinction. The paper also studies extinction times \(T_e\) for the Binomial Logistic map at \(\mu=4\), a chaotic deterministic regime, and reports that the extinction-time distributions are approximately discrete-exponential, except at \(T_e=1\) and \(T_e=2\). This positions Binomial maps as discrete-time analogues of finite-population continuous-time simulations based on Gillespie-type methods: many stochastic trajectories can be generated and the full extinction-time distribution estimated. The broader program is explicitly finite-population analysis within map-based models. The framework is presented as opening the door to rigorous study of extinction risk, quasi-stationarity, and noise-induced transitions. At the same time, several foundational dynamical-systems questions remain open, including how to define stability in the stochastic setting, how to characterize sensitive dependence on initial conditions, how to analyze bifurcations under stochasticity, and how to describe long-term behavior in the presence of fluctuations. ## 5. Binomial maps on words and \(k\)-binomial complexity In combinatorics on words, “binomial map” language refers to subsequence-count invariants. For finite words \(u,v\), the binomial coefficient of words \[ \binom{u}{v} \] counts the number of occurrences of \(v\) as a subsequence of \(u\). Two words are \(k\)-binomially equivalent if \[ u\sim_k v \quad\Longleftrightarrow\quad \binom{u}{x}=\binom{v}{x}\ \text{for all }x\in A^{\le k}. \] For an infinite word \(\mathbf{x}\), the \(k\)-binomial complexity is \[ b_{\mathbf{x},k}(n)=\#\big(\mathrm{Fac}_n(\mathbf{x})/\!\sim_k\big), \] and the associated binomial map may be written as \[ \mathcal B_k:A^*\to \mathbb N^{A^{\le k}}, \qquad u\mapsto \left(\binom{u}{v}\right)_{v\in A^{\le k}}. \] Then \(u\sim_k v\) exactly when \(\mathcal B_k(u)=\mathcal B_k(v)\) [1812.07330]. The classical Thue–Morse word provides the canonical explicit example. For every positive integer \(k\), \[ b_{\mathbf t,k}(n)=p_{\mathbf t}(n) \qquad\text{for }n\le 2^k-1, \] while for all \(n\ge 2^k\), \[ b_{\mathbf t,k}(n)= \begin{cases} 3\cdot 2^k-3,& n\equiv 0\pmod{2^k},\\[1mm] 3\cdot 2^k-4,& \text{otherwise.} \end{cases} \] The threshold is exactly \(n=2^k\). Below it, no two distinct factors of length \(n\) are \(k\)-binomially equivalent; from \(n\ge 2^k\) onward the complexity takes only two values depending on \(n\bmod 2^k\). For \(k=2\), this gives \[ b_{\mathbf t,2}(0)=1,\quad b_{\mathbf t,2}(1)=2,\quad b_{\mathbf t,2}(2)=4,\quad b_{\mathbf t,2}(3)=6, \] and for all \(n\ge 4\), \[ b_{\mathbf t,2}(n)= \begin{cases} 9,& n\equiv 0\pmod 4,\\ 8,& \text{otherwise.} \end{cases} \] The structural explanation is boundary alignment relative to the Thue–Morse block decomposition. For factors \(u,v\) of length \(n\ge 2^k-1\), \[ u\sim_k v \quad\Longleftrightarrow\quad (p_u,s_u)\equiv_k (p_v,s_v), \] where \((p_u,s_u)\) and \((p_v,s_v)\) are order-\(k\) factorization pairs and \(\equiv_k\) is the boundary-pair equivalence relation introduced for the proof. In this regime, the entire bounded-length subsequence-count vector is determined by order-\(k\) type. This suggests that the binomial map \(\mathcal B_k\) becomes a coarse boundary invariant once factor length exceeds the intrinsic substitution scale. ## 6. Morphisms, boundedness transfer, and generalized Thue–Morse words A second line of work studies how morphisms act on binomial complexity. For a morphism \(f:A^*\to B^*\), the relevant class is that of Parikh-collinear morphisms, equivalently morphisms whose adjacency matrix has rank \(1\). These are exactly the morphisms that raise boundedness one level in the binomial hierarchy: \[ f \text{ is Parikh-collinear} \iff \forall k\ge 0,\ f \text{ maps words with bounded }k\text{-binomial complexity to words with bounded }(k+1)\text{-binomial complexity}. \] Equivalently, for all \(k\ge 2\), \[ u\sim_{k-1} v \implies f(u)\sim_k f(v). \] A direct corollary is that fixed points of Parikh-collinear morphisms have bounded \(k\)-binomial complexity for every \(k\) [2201.04603]. The Thue–Morse morphism \[ \varphi:\quad 0\mapsto 01,\qquad 1\mapsto 10 \] is Parikh-constant, hence Parikh-collinear. It satisfies \[ \varphi^k(0)\sim_k \varphi^k(1), \qquad \varphi^k(0)\not\sim_{k+1}\varphi^k(1), \] which explains why powers of \(\varphi\) can wash out lower-order binomial distinctions while preserving higher-order ones. The same paper gives a new characterization of Sturmian words: if for some fixed \(k\ge 2\), \[ b_{\mathbf z,k}(n)=n+1\qquad \forall n, \] then \(\mathbf z\) is Sturmian. For generalized Thue–Morse words \(\mathbf t_m\) over the alphabet \(\mathcal A_m=\{0,\dots,m-1\}\), generated by the \(m\)-uniform substitution \[ \sigma_m(i)=i(i+1)\cdots(i+m-1), \] the \(k\)-binomial complexity has now been computed explicitly for every \(m\ge 2\) and \(k\ge 2\). The shortest pair of distinct \(k\)-binomially equivalent factors has length \(2m^{k-1}\), so \[ n<2m^{k-1}\quad\Longrightarrow\quad b_{\mathbf t_m,k}(n)=p_{\mathbf t_m}(n). \] For \(n\ge 2m^k\), if \[ \lambda=n \pmod{m^k},\qquad \lambda=\nu m^{k-1}+\mu,\qquad \nu