Section 6 4 October 2026

Recombination and the removal of surplus

Jeremy Rodgers · Independent Researcher
doi:10.5281/zenodo.23131075

Original PDF ↗Section Markdown Full Markdown All contents

Reading position 7 of 17

6 Recombination and the removal of surplus

For the Poisson contact comparison, every eligible packet–carrier pair has derived rate $\kappa_e\mu_N/N$ , and every opposite slot pair has derived rate $a_e$ . Let $P_e^\pm$ be species counts, $m_e^{\rm mix}=\min(P_e^+,P_e^-)$ , and $A_e,D_e$ the recombination and service counts. Starting from empty packet stock, exactly

P_e^+(t)+P_e^-(t)+2A_e(t)+D_e(t)=\#\mathrm{births}_e(t)\le B_e.

(12)

The accepted reaction process is nonexplosive. Both service directions are active whenever both species and their origins are populated.

Theorem 6.1 (Full reaction-state recombination comparison)

Assume initially empty packet stock and the stated per-edge birth budgets. Let $S^a$ denote the reaction state of the Poisson comparison: field, actions, residues, all packet slots, carriers and reaction-product receivers, including null-contact records. It does not denote the original gas flight coordinates. The two-species reaction process has a lifted comparison process whose aggregate is exactly the instantaneous signed-queue model, with

\TV\bigl(\Law(S^{a}_{[0,T]}),\Law(S^{\rm lift}_{[0,T]})\bigr) \le \Delta_{\rm ann}:=\sum_e\frac{\kappa_e\mu_NB_e}{2a_e}.

(13)

Both processes retain slots, products and receivers. In particular this bound holds for their complete aggregate carrier paths and exact event times. It holds for any prescribed signed birth sequence of the stated budgets, including reversals and arbitrarily close births.

Proof

In each state match all minority packets with the same number of majority packets by a fixed ordering of their physical labels. This matching is a proof device. The lifted reference has the same births and all the same recombination channels, but services only the $|Z_e|$ unmatched excess packets. Let $\pi$ retain the field, actions, residues, net queues $Z$ , all carrier coordinates and the common edge/carrier/direction service marks. It omits physical recombination times and does not identify their product archive with an instantaneous-cancellation archive. Recombination leaves $Z_e=P_e^+-P_e^-$ invariant; excess service changes it exactly as a signed-queue service. For each carrier at the excess-species origin there are $|Z_e|$ possible packet partners. Consequently the generator on functions of $\pi$ is exactly the signed-queue generator, independent of hidden matching and slot labels. This explicitly proves lumpability for this projection.

Couple all common transitions while full states agree. The physical process additionally services matched packets, with discrepancy hazard

h_e=\frac{\kappa_e\mu_N}{N}m_e^{\rm mix}(n_r+n_q)\le\kappa_e\mu_Nm_e^{\rm mix}.

Continue correct marginals after the first such event. Since $m_e^{\rm mix}\le P_e^+P_e^-$ and the annihilation compensator gives

a_e\E\int_0^T P_e^+P_e^-\dd t=\E A_e(T)\le B_e/2,

the stopping time $\tau$ of the first discrepancy obeys

\Prb(\tau\le T)\le \E\int_0^{T\wedge\tau}\sum_e h_e(t)\dd t \le\sum_e\kappa_e\mu_N\E\int_0^T P_e^+(t)P_e^-(t)\dd t \le\Delta_{\rm ann}.

The stopped integral is bounded by the complete physical marginal integral. Probability of any discrepancy bounds entire-path total variation. The construction agrees on every retained receiver up to that discrepancy.

□

The physical finite- $a$ aggregate is generally not Markov in $Z$ and carriers alone; its rates depend also on the mixed stock. No closure is assumed for that projection. An additional direct consequence is

\Prb(\text{any service while an edge is mixed})\le\Delta_{\rm ann},

because, on $m_e^{\rm mix}>0$ , its total service rate is at most $\kappa_e\mu_N\max(P_e^+,P_e^-)\le\kappa_e\mu_NP_e^+P_e^-$ . Minority suppression follows from a competition of physical reaction speeds, not an imposed positive-part gate.