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.
Tau Leaping and Reaction Diffusion Model Error
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Event observation, censoring, truncation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- IID Monte Carlo integration and error
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Markov Kernels and Markov Chains
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Multilevel Monte Carlo and cost theorem
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Parametric survival and reliability
- Pointwise Extended-Real Function Products
- Poisson and Cox point processes
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Statistical, resampling, simulation, and numerical error ledger
- Stochastic Reaction Jump Simulation and Coupling
- Subspaces, Products, and Quotients
- Suprema and Infima
- Temporal intensity and likelihood
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
2 · Summary
Explicit Poisson tau leaping freezes each channel propensity over a step and draws independent Poisson counts. The local moment and one-step weak-defect results lead to a bounded finite-state weak-order-one theorem with the probability of leaving the physical state set stated separately. The theorem does not cover unbounded rates or erase the invalid-state warning.
For adjacent time levels, a shared-minimum Poisson count with independent rate-difference residuals gives the stated marginal laws. Under bounded propensities on the integer lattice, the proof propagates the coupled state discrepancy and obtains an order-one correction variance. T16's exact event-time reaction-path coupling is a distinct procedure; the fixed-step count coupling is proved locally here.
The density-scaled model uses jump size at rate . A stopped finite-state Dynkin identity and a third-order generator expansion give an jump-versus-CLE weak term under a separate smooth backward-solution assumption. Exit probabilities are an additional term, so this is model error rather than time-discretization error.
The critical-reaction SSA/binomial method has a finite step budget and explicit infeasible or inconclusive statuses. Its binomial count protects the sequential state update, changes the Poisson variance, and receives no Poisson weak-order or MLMC guarantee.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Explicit Poisson tau-leaping with an invalid-state status
Definition
Inputs. A finite-channel reaction propensity system Finite-channel reaction propensity systems and their generator, an initial state , a deterministic grid with finite , and a draw budget . Write . At each step the count vector has the product law whose th marginal is , as defined in The scalar Poisson count law. The budget counts scalar Poisson draws.
Output. The recorded grid endpoint pairs, with piecewise-constant interpolation, and a status in {horizon, absorbed, invalid-state, budget-exhausted}. The budget-exhausted output is an incomplete prefix and is not a terminal sample at .
Procedure. Set , grid index , Poisson-draw counter , recorded path , and status horizon.
- If , return with status horizon. If , set status invalid-state and hold fixed to . If does not end at , append that pair; if , append ; then return. If , hold fixed to , append to if needed, and return with status absorbed.
- If and , return the path prefix with status budget-exhausted; it does not define a terminal sample at .
- Draw conditionally independent , , and set . Increase .
- Advance time to and append to . If , set , set status invalid-state, and keep fixed through all remaining grid times; append to if , then return. If , set , increment , and continue.
Density-scaled reaction jump and chemical Langevin generators
Definition
Fix finitely many stoichiometric vectors , an open set , nonnegative propensity functions , and a volume parameter . At a density state for which every positive-rate destination lies in , the density-scaled jump model has jump at rate . For a twice differentiable test function defined at those destinations, its generator is
Put and . The associated chemical Langevin diffusion generator is A Markov diffusion with this generator is called the chemical Langevin model here. The definition does not assert existence, uniqueness, positivity, or approximation accuracy for either process. In an SDE representation the drift is and the covariance matrix per unit time is .
Dynkin identity for a bounded-rate finite stopped reaction chain
Statement
Assume Countable Choice and Dependent Choice. Let and be disjoint finite sets of states, and let a finite-channel reaction chain move from a state by channel to at rate . Assume its total rate is at most on , and make every state in absorbing. Let have a continuously differentiable time section for each state, with continuous in time. Define Then, for the stopped chain and , In particular, may be the finite set of lattice states inside a compact stopping region, and the finite set of one-jump exit destinations.
Facts & Assumptions
Given: Countable Choice, Dependent Choice, finite , a finite-channel reaction chain with bounded total rate on , absorbing states on , and a time-differentiable .
Finite-channel reaction propensity systems and their generator: a channel at state makes the marked transition at rate ; its generator sums over channels.
Competing exponential clocks give the reaction event law: at a fixed state with total rate , the waiting time has survival and channel has event-time density ; if , no event occurs.
Finite-state Gillespie and next-reaction methods have the specified CTMC law: under Countable Choice and Dependent Choice, a finite reaction system has the specified exact CTMC path law, and its expected number of events on is at most for . In particular, it has finitely many events on every finite horizon almost surely.
Countable Choice is assumed in [F2] for the exponential probability law. The Axiom of Countable Choice ()
Dependent Choice is assumed in [F3] for the countable product of independent event inputs. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Proof
Given: The finite stopped chain, Countable Choice, Dependent Choice, and facts [F1]–[F3].
Uniformly over , the no-event probability in a time interval of length is , where on and on . Its difference from is at most . For a channel from , the probability that it fires once at time and no later event occurs is Both rates in the exponent are at most , so its difference from is at most . Summing over channels gives at most . After the first event, the conditional probability of another before is at most ; integrating against the first-event rate, at most , shows that the probability of at least two events is at most . These estimates are uniform on the finite state set.
Since is finite and is continuous, uniformly in and , The zero-event probability is ; the single-channel probabilities are by step 1.1; and the multiple-event probability is . In the zero-event case, the contribution is . The one-event channel contributions are , because the time change in is multiplied by an event probability. The multiple-event contribution is . Adding the cases, the order- terms are with a uniform remainder. This is ; for the chain is fixed and . Multiple-event payoffs contribute because is bounded on the finite set.
Sum the conditional identity in step 2.1 over a deterministic partition of and take expectations. The uniform remainders sum to . By [F3] the chain has finitely many jumps almost surely on ; therefore is bounded and piecewise continuous, so its Riemann sums converge pathwise. Boundedness and dominated convergence let expectations pass to the integral. The left side telescopes to , proving the identity.
Conditional moments of one Poisson tau-leap increment
Statement
Fix a state and step in Explicit Poisson tau-leaping with an invalid-state status. Let , where conditionally independent . Then and
Facts & Assumptions
Given: A state , a step , the product count law in Explicit Poisson tau-leaping with an invalid-state status, and the Poisson count laws below.
The scalar Poisson count law: for , a count has masses (with a point mass at zero when ).
Explicit Poisson tau-leaping with an invalid-state status: the channel counts are conditionally independent and the state increment is .
Proof
Given: The inputs above.
Each parameter is finite, so [F1] defines the corresponding Poisson law and [F2] gives . By [F3], conditional expectation is linear, hence .
Conditional independence in [F3] makes cross-channel covariances zero. The covariance of is by [F2]. Summing proves the covariance formula.
For a square-integrable vector, . Substitution of steps 1.1 and 1.2 gives the asserted identity.
One-step weak defect of finite-state Poisson tau-leaping
Statement
Assume Countable Choice and Dependent Choice. Let be finite, let , and assume whenever . Extend every state outside as absorbing, as in Explicit Poisson tau-leaping with an invalid-state status. For , let be the exact reaction-chain transition kernel and the Poisson tau-leap transition kernel. If is bounded, then and hence The bounds include the multi-reaction leap probability that can trigger the invalid-state branch.
Facts & Assumptions
Given: Finite reaction data Finite-channel reaction propensity systems and their generator, the exact reaction chain law specified there, the tau-leap kernel Explicit Poisson tau-leaping with an invalid-state status, and a bounded .
Finite-channel reaction propensity systems and their generator: a single channel- event from has destination and rate ; forbidden one-event transitions have zero propensity.
Competing exponential clocks give the reaction event law: at state , the next-event survival is and the channel- event density is .
Explicit Poisson tau-leaping with an invalid-state status: conditional channel counts are independent Poisson variables of means and any out-of- leap is absorbing.
The scalar Poisson count law: the count mass is for finite .
Normalization, moments, and generating function of the Poisson count law: a Poisson count of mean has mean and factorial second moment .
Finite-state Gillespie and next-reaction methods have the specified CTMC law: under Countable Choice and Dependent Choice, the finite-state reaction system has its specified exact path law and has finitely many events on finite horizons.
Countable Choice is assumed by [F2] for the exponential probability law. The Axiom of Countable Choice ()
Dependent Choice is assumed by [F6] for the countable input streams. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Proof
Given: Countable Choice, Dependent Choice, a step , as in the Statement, and .
If , then and both kernels are the identity on , so every asserted bound is zero. Otherwise fix .
For the Poisson leap, the probability of zero total counts is . The probability that exactly channel fires once is , so its difference from is at most . Summing these errors over gives at most . If , independence and [F5] give hence . The zero-count probability differs from by at most . A single allowed channel event remains in by [F1], so only the part can trigger the invalid-state branch. The zero-count, total single-count, and multiple-count contributions are bounded respectively by , , and . Thus .
For the exact chain, the no-event probability is , which differs from by at most . The probability of one channel- event and no later event is Its difference from is at most , since all total rates on are at most ; summing over gives at most . The probability of two or more events is at most : conditional on a first event at time , a later event has probability at most , and integration against the first-event rate bounded by gives the bound. The no-event, total single-event, and multiple-event contributions are bounded respectively by , , and . Therefore .
Subtract the two first-order expansions from steps 1.1 and 1.2 and use the triangle inequality. This gives for every . Outside both kernels hold the state fixed, so the same bound holds there. Taking the supremum proves the final inequality.
Stopped density-scaled jump versus chemical Langevin weak model error
Statement
Assume Countable Choice and Dependent Choice. Use the density-scaled generators in Density-scaled reaction jump and chemical Langevin generators. Let be compact and the closure of a bounded open stopping region with nonempty interior, let , and let be a containing lattice. For fixed , the set is finite: boundedness of bounds each integer coordinate index in the lattice. Let be the jump process stopped at and let be a chemical Langevin diffusion stopped at . Assume both stopped processes exist with , and write and .
Assume , on , and every segment for with lies in . For a bounded payoff with , suppose the stopped CLE backward solution has an extension to an open neighborhood of and all these jump segments that is in space and in time, with on all states reached by the stopped jump chain and on every exit state (including diffusion boundary points), and and is continuous in time on the stated neighborhood. The third-derivative bound holds along every jump segment. The derivatives are spatial Fréchet derivatives with operator norm. Then If the original local jump and diffusion models are defined through and are coupled to agree with their stopped versions up to their respective exits, then The term is density-model error from the generator expansion; the exit term is separate. Neither term is time-discretization error. The existence and regularity of the CLE backward solution are assumptions, not consequences of this estimate.
Facts & Assumptions
Given: Countable Choice, Dependent Choice, the density-scaled generators, the compact stopping region, bounded propensities on , and the stopped CLE backward solution with the stated boundary and derivative conditions, with .
Density-scaled reaction jump and chemical Langevin generators: for a state before exit,
Dynkin identity for a bounded-rate finite stopped reaction chain: a finite-state reaction chain stopped on its finite exit set obeys the time-dependent Dynkin identity. For this fixed , the lattice states in form a finite set, and each has at most one-jump destinations, so their exit set is finite. The total reaction rate before exit is bounded by . Relabeling a density state by transports the channel increments to and the rates to , so the supplier applies to this chain.
Countable Choice is assumed for the exponential event law in [F2]. The Axiom of Countable Choice ()
Dependent Choice is assumed in [F2] for the countable input streams. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
The stopped CLE and its stated backward solution exist; the backward equation, boundary values, and third-derivative bound hold. They are not inferred from Taylor expansion of the jump generator.
For the unstopped comparison, each original process agrees with its stopped version up to its first exit, and globally.
Proof
Given: Countable Choice, Dependent Choice, the stopped processes starting at , the derivative and propensity bounds, the backward equation, and the finite stopped-chain Dynkin identity.
Fix an interior lattice state and a time . For channel , apply one-variable Taylor's theorem to on . Its third-order remainder has absolute value at most . Multiplying by and summing over channels gives where The first two terms are exactly by [F1].
Set , , and let be the images under of the one-jump exit destinations from . These are disjoint finite subsets of . The transported stopped chain moves from by channel increment at rate and is fixed on . For , its time derivative is unchanged and its reaction generator on equals . Apply [F2] to this integer-lattice chain and . Before , the integrand is by the backward equation [A3]. After exit, is fixed at an exit destination where is independent of , so both its time derivative and stopped generator vanish. At time , , and the common initial condition gives and . Therefore
Bound the integrand in step 1.2 by step 1.1 and use . This proves the stopped-process estimate. Under [A4], the stopped and original terminal payoffs agree unless their respective process exits by time ; on that event their difference is at most . The triangle inequality for the two expectations adds at most , which proves the unstopped bound.
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.
Weak order one for finite-state Poisson tau-leaping with an exit bound
Statement
Assume Countable Choice and Dependent Choice. Let be finite, let for the system Finite-channel reaction propensity systems and their generator, and assume whenever . Extend the exact chain by making every state outside absorbing, and let be the tau-leap kernel in Explicit Poisson tau-leaping with an invalid-state status with the same absorbing-invalid-state convention. For with and , an initial state , and a bounded payoff , run the leap on the uniform grid with draw budget (or ), so it supplies a terminal state . Then the leap satisfies Its probability of ever entering an invalid state by is at most . This separately bounds the absorbing invalid-state branch; the result makes no claim for unbounded rates.
Facts & Assumptions
Given: Countable Choice, Dependent Choice, the finite-state reaction system and admissibility condition in the Statement, a nonexplosive exact chain with that channel law, a uniform positive step with , draw budget or , and bounded .
Finite-channel reaction propensity systems and their generator: channel has rate and update ; if the update is outside , its propensity is zero.
Explicit Poisson tau-leaping with an invalid-state status: with the stated sufficient budget, the tau-leap kernel uses conditionally independent counts and freezes the first invalid endpoint.
One-step weak defect of finite-state Poisson tau-leaping: the one-step kernels obey .
Normalization, moments, and generating function of the Poisson count law: for a Poisson count with parameter , .
Finite-state Gillespie and next-reaction methods have the specified CTMC law: under Countable Choice and Dependent Choice, the finite system has its specified exact path law and finitely many events on finite horizons.
Countable Choice is assumed by [F3] for the exact reaction-chain event law. The Axiom of Countable Choice ()
Dependent Choice is assumed by [F5] for the countable input streams. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Proof
Given: The inputs above, with exact transition kernel and tau-leap kernel on the common countable state space.
At most scalar Poisson draws are needed for steps, so the stated budget never exhausts; absorption or an invalid endpoint instead holds the state through . The terminal leap law is therefore . Both and are Markov kernels: they preserve nonnegative functions and constants, so each is a contraction in the supremum norm. Outside , both hold the state fixed by the stated extension.
The finite algebraic identity follows by cancellation of consecutive terms. Apply it to , use the contraction from step 1.1 and the one-step bound [F3] to obtain Evaluating at proves the weak-order bound.
While the leap state is in , any single channel count produces a state in by [F1]. Therefore an invalid endpoint requires at least two total channel firings in that step. If , independence [F2] and the factorial moment [F4] give Since , the conditional invalid-step probability is at most . A union bound over steps gives .
Critical-reaction binomial guarded tau-leaping
Definition
Inputs. A finite state reaction system Finite-channel reaction propensity systems and their generator with nonzero jump vectors, initial state , horizon , maximum leap , critical threshold , finite step budget that is a nonnegative integer, and independent ideal random inputs for the procedure. Use a fresh independent direct-method stream on every critical SSA call. Also use mutually independent unit-uniform streams , independent of all SSA streams, for leap indices , channels , and positive trial indices . A binomial draw with parameters is the number of the first entries in its stream that are less than . The countable product of these input laws exists under Countable Choice and Dependent Choice by Assuming countable and dependent choice, countable products of arbitrary probability spaces. The first-event law of the critical SSA subroutine is the one in Finite-state Gillespie and next-reaction methods have the specified CTMC law. For a state and channel , define its admissible firing capacity Finiteness of and make this maximum finite. Let be the critical set. When , hold fixed and form the finite reaction system on using only those channels, with their original propensities. If , do not form a restricted system and define the critical result to be no event. In the nonempty case, the critical SSA subroutine runs the direct Gillespie method on this restricted system with event budget one and horizon ; it returns its first event if it occurs strictly before , where , and otherwise returns no event.
Output. The recorded states at accepted leap endpoints, with piecewise-constant interpolation, and a status in {completed, absorbed, invalid-state, inconclusive, step-size-infeasible, critical-interface-required}. A noncompleted step-size, interface, or budget failure returns the current path prefix. Absorption and invalid-state handling record the held state through .
Procedure. Set , , step counter , recorded path , and status completed.
- If , return with status completed. If , append to if needed, append if , and return with status invalid-state. If before , return the current path prefix with status inconclusive. If , hold fixed through , append to if needed, and return with status absorbed.
- Compute and where the inner minimum over an empty set is . If , return step-size-infeasible with the current path prefix. If , record that there is no critical event and skip the critical SSA call. If , call critical SSA for horizon ; it returns either no critical event before , or a pair with and . Set to in the event case and to otherwise.
- Starting from , process the noncritical channels in increasing index order. Recompute . If and , return critical-interface-required with the current path prefix. Otherwise set when . When , set ; if , return step-size-infeasible with the current path prefix and without rejecting and resampling. Set
- If critical SSA returned , return inconclusive with the current path prefix when ; otherwise apply that critical reaction to . If the call returned no event, leave unchanged. Set , set , append to , set , and repeat.
MLMC work bound for bounded finite-state Poisson tau-leaping
Statement
Assume Countable Choice and Dependent Choice, and the finite-state hypotheses of Weak order one for finite-state Poisson tau-leaping with an exit bound and Order-one correction variance for coupled Poisson tau-leap levels, with bounded payoff . Use levels and couple adjacent Poisson tau-leap paths by the shared-minimum construction. Under the work convention that each channel Poisson draw, propensity evaluation, and stoichiometric update has unit cost, for each one correction sample costs at most : there are fine half intervals, each using at most shared and residual Poisson draws and propensity and update work. The base-level sample uses one path and costs , which is for fixed . The level bias is and the correction variance is . Therefore, for all sufficiently small , deterministic sample counts in the generic multilevel estimator can achieve mean square error at most with work This conclusion applies only to the explicit Poisson leap and the bounded finite-state hypotheses above. It is not a correctness or error guarantee for the guarded binomial algorithm Critical-reaction binomial guarded tau-leaping.
Facts & Assumptions
Given: The geometric hierarchy, adjacent-level coupling, finite-state error hypotheses, and unit-cost convention in the Statement.
Weak order one for finite-state Poisson tau-leaping with an exit bound: the payoff bias at level is at most .
Order-one correction variance for coupled Poisson tau-leap levels: the adjacent-level correction variance is at most .
Geometric MLMC hierarchy and coupled corrections and Expectation, variance, and MSE of a finite MLMC estimator: the finite multilevel estimator telescopes in expectation and has variance equal to the sum of level correction variances divided by their sample counts.
MLMC cost complexity under bias, variance, and work rates: if bias is , correction variance is , and level cost is , the stated MLMC work upper bounds apply.
Countable Choice is assumed through the exact finite-state chain used in [F1]. The Axiom of Countable Choice ()
Dependent Choice is assumed through the countable random input stream used to define that chain. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Proof
Given: Countable Choice, Dependent Choice, and the assumptions above.
For , the fine and coarse paths use and steps, respectively; both ratios are integers on the dyadic hierarchy. On each fine half interval, each channel uses one shared and two residual Poisson counts, hence at most scalar draws and propensity and update work; the two coarse count vectors are accumulated over each coarse interval. Thus the correction cost is for fixed . At level zero, a single path takes one step and uses work; since is fixed, this is also after changing the constant.
By [F1] the bias exponent in [F4] is . By [F2], every adjacent-level variance for is . At level zero, , so ; since , increasing the variance constant gives the required bound there as well. Thus the variance exponent for all levels is . Apply [F4] with refinement factor and these exponents. Its case gives work while controlling the MSE by [F3].
5 · Examples, counterexamples and false statements
None yet.
Sources
- David F. Anderson and Desmond J. Higham, Multilevel Monte Carlo for continuous time Markov chains, with applications in biochemical kinetics
- Tiejun Li, Lecture 21: Application in chemical reaction kinetics, Applied Stochastic Analysis course notes
- Daniel T. Gillespie, Approximate accelerated stochastic simulation of chemically reacting systems
- David F. Anderson, Desmond J. Higham, and Yu Sun, Complexity of multilevel Monte Carlo tau-leaping
- Tiejun Li, Analysis of explicit tau-leaping schemes for simulating chemically reacting systems
- David F. Anderson and Thomas G. Kurtz, Continuous Time Markov Chain Models for Chemical Reaction Networks
- Michael B. Giles, Multilevel Monte Carlo Path Simulation