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.
Full-resampling fixed-level SIR splitting with invariant mutations
Definition
Input the nested levels of Nested rare-event levels and conditional laws on a standard Borel state space , a particle count , and probability kernels for . Each mutation kernel must satisfy If a required kernel is unavailable or violates its declared conditions, return mutation-kernel-unavailable.
Apply the canonical full-resampling sequential importance-resampling procedure of Sequential importance resampling for Feynman–Kac path targets to the following finite Feynman–Kac model: initial law , initial potential , identity transition , event potential , and, for , transition and potential . Use multinomial full resampling at every selection and proposal kernels equal to the target transitions, so each Radon–Nikodym correction is one.
Return the SIR normalizer estimate and the full particle output. If any incremental average event weight is zero, report status zero-particle-prefix and , as in the canonical SIR procedure. This status does not assert that the target probability is zero. The exact conditional level sampler is not inferred from the existence of an invariant kernel; kernel accessibility is an input requirement.
Depends on
Used by
- Conditional future means alone do not bound finite-particle SIR error Counterexample
- A zero-particle prefix does not prove a zero event probability Example
- Conditional event second moments give a finite-particle SIR relative MSE bound Theorem
- Fixed-level full-resampling SIR splitting is unbiased Theorem
- Fixed-level SIR has an absolute O(L/N) mean-square bound Theorem
Dependency tree · two levels
20 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
- Frédéric Cérou, Pierre Del Moral, and Arnaud Guyader, A nonasymptotic theorem for unnormalized Feynman–Kac particle models, §§1–2 (standard reference, not scraped)
- Adam M. Johansen, Pierre Del Moral, and Arnaud Doucet, Sequential Monte Carlo Samplers for Rare Events, ``2–3 (standard reference, not scraped)