How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Order-one correction variance for coupled Poisson tau-leap levels
Statement
Assume the finite-state reaction system of Finite-channel reaction propensity systems and their generator has propensities bounded on and extended by zero to states outside . Let , for , and let both levels start at the same fixed state . For each , couple a fine step to a coarse step as follows. On each of the two half intervals, with fine state and coarse state , use for channel a shared count and independent residual counts of means and for the fine and coarse paths, as in Shared-minimum coupling of two Poisson counts. Use independent copies across channels and fresh copies on the two half intervals. Update the fine state after each half interval. Accumulate the two coarse count vectors into one coarse leap, evaluating both at the coarse state at the start of the full interval. Then, for every bounded , where depends on , the finite network, and , but not on . This is a variance bound for the stated coupled Poisson leap; independent levels are not covered.
Facts & Assumptions
Given: The finite reaction network, common initial state, bounded propensities, the Poisson tau-leap rule, and the half-step coupling just specified.
Finite-channel reaction propensity systems and their generator: the states and reaction increments are integer vectors, there are finitely many channels, and a positive-rate firing has destination in .
Conditional moments of one Poisson tau-leap increment: for a one-step increment at state ,
Explicit Poisson tau-leaping with an invalid-state status: each marginal leap uses conditionally independent channel counts with means at its frozen state and freezes after an invalid state.
Normalization, moments, and generating function of the Poisson count law: a count has mean and variance .
Shared-minimum coupling of two Poisson counts: per channel, the coupled counts have the prescribed Poisson marginals, their difference has mean , and its variance is .
Count constructions are independent across channels conditional on their starting states, and the fresh second-half random inputs are independent of the complete first-half history.
Proof
Given: The common initial state and facts [F1]–[F5], with .
For a level with , the variance bound follows directly from . It remains to prove the recurrence below for .
For lattice states , write and . Bounded rates and the integer lattice's minimum nonzero distance one imply for a constant ; this also holds when one state is outside , where the extended rate is zero. In one half interval, shared counts cancel from the increment difference . The independent residual Poisson counts and [F5] give Thus and the centered second moment is at most . If , then . Otherwise , so . For this proves
If , the invalid-state convention freezes the fine path, so its increment is zero and the estimates below are immediate. Suppose , and let be its fine-path increment on the first half interval. By [F3], [F4], and the triangle inequality, By [F2] and bounded propensities, for . If , then For the second inequality, expand and use and ; the cross term is bounded by when , and is zero when .
Write the two half-interval differences as , where is the conditional mean and is centered given the starting states of that half interval. Step 1.1 gives The second half starts at and , so . Steps 1.1 and 1.2 therefore give For the latter inequality, use and when . Let be the complete first-half history. The fresh second-half copies are independent of that history, so and .
Fix the starting pair during this expansion; the estimates are uniform in the pair and depend on it only through . The endpoint error is . First, The vector is -measurable, so makes its expected inner product with zero. The remaining cross terms satisfy with value zero if , and The additional terms satisfy and by step 2.1. Combining these expansion terms proves the recurrence conditional on ; averaging over starting pairs with difference gives
Let at coarse endpoints. Since , step 3.1 gives . There are coarse intervals, so iteration yields
If , its integer coordinates imply , hence . The payoff difference is zero when and is at most in absolute value otherwise. Its variance is at most its second moment, hence at most . For the same conclusion follows directly from .
Notes
The T16 Minimum-intensity coupling of reaction networks is an exact event-time coupling built by dominating Poisson thinning. The present theorem uses the separately proved frozen-rate count coupling Shared-minimum coupling of two Poisson counts on each tau-leap half-step; it does not identify the two path procedures.
Depends on
Used by
Dependency tree · two levels
15 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- David F. Anderson and Desmond J. Higham, Multilevel Monte Carlo for continuous time Markov chains, with applications in biochemical kinetics (standard reference, not scraped)
- David F. Anderson, Desmond J. Higham, and Yu Sun, Complexity of multilevel Monte Carlo tau-leaping (standard reference, not scraped)