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.
Split multi-chain autocorrelation effective sample size
Definition
Inputs: scalar chains of equal length . This estimator targets the functional-specific quantity in Functional-specific effective sample size from finite arrays; it does not test stationarity or a central limit theorem.
- Split every input chain into its first and last observations. If is odd, discard its middle observation. Denote the resulting chains by and set .
- Compute their means , sample variances , their average , grand mean , between-chain term , and . If any or , return not estimable.
- For , compute the biased autocovariances , the within-chain autocorrelations , and the between/within adjusted combined autocorrelation
- For , form . If , return not estimable. Let be the largest for which are all positive; if or no is available. Put and . If the next even lag is available, put ; otherwise put . Set .
- If , return not estimable. Otherwise return The second term is the paper's finite software cap for very short, strongly antithetic chains.
Negative serial correlation can make the estimate exceed the retained split draws, subject to that software cap. The output is an estimator, not a guarantee about the target law.
Depends on
Used by
- Bulk effective sample size Algorithm
- Quantile Monte Carlo standard error Algorithm
- Tail effective sample size Algorithm
Dependency tree · two levels
3 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
- Aki Vehtari et al., Rank-normalization, folding, and localization, §3.2, equations (10)–(13) (standard reference, not scraped)
- Art B. Owen, Monte Carlo Theory, Methods and Examples, Chapter 11, §11.12 (standard reference, not scraped)