Lehmann–Scheffé theorem 2026-10-07
An unbiased estimator that is a function of a complete sufficient statistic is the unique uniformly minimum-variance unbiased estimator, up to almost sure equality. Rao-Blackwellization supplies variance reduction, and completeness supplies uniqueness. The theorem applies to a conditional statistical experiment as well, when unbiasedness, sufficiency and completeness are all evaluated under that conditional family.
Limiting MA(1) innovations coefficient 2026-10-07
For an MA(1) process, the recursion has candidate limits and . The limit in is when and otherwise. The limiting innovation variance is , expressing the same covariance law through an invertible reciprocal representation.
Logarithmic-regime giant component 2026-10-07
Fix , , and with . A binomial random graph has one giant component of the displayed order and all other graph components are tree components of orders at most , with high probability. The expected value and variance of the isolated vertex count concentrate it around . A Cayley formula upper bound for connected sets excludes component sizes through a small fixed fraction of ; the empty-graph cut bound excludes the remaining sizes up to . An extra-edge count excludes cyclic small graph components. The expected value of the number of vertices in small nonisolated tree components is , where . The Markov inequality completes the count of vertices outside the unique large graph component.
Log odds ratio 2026-10-05
The log odds ratio is the natural logarithm of an odds ratio. For two independent binomial groups with positive event and non-event counts and , its estimate is , with first-order variance by the delta method. Zero cells need a method that handles boundary data; the displayed normal approximation is not valid there.
Log risk ratio 2026-10-07
The logarithm of a risk ratio is zero at equal risks, negative when the first risk is smaller, and positive when it is larger. For independent binomial event counts from samples , its usual delta-method variance estimate is . This approximation requires nonzero counts; zero-event arms need another procedure. Log estimates are convenient for inverse-variance meta-analysis, and exponentiation returns to the risk-ratio scale.
Mantel–Haenszel pooled odds ratio 2026-10-07
For independent two-by-two tables with counts and total , the Mantel–Haenszel pooled odds ratio is the displayed ratio of sums. When all , it is also the weighted arithmetic mean of study odds ratios with weights . These differ from inverse estimated variance weights for log odds ratios. Both constructions can represent a fixed-effect meta-analysis, but they should not be silently interchanged when interpreting a supplied plot.
Marked-set connectivity threshold 2026-10-07
For a fixed set of vertices, let be the first step at which they all belong to one graph component. In the uniform random graph process, lies between and with high probability for every . Below that scale the marked isolated vertex count has divergent expected value and small relative variance. Above it the logarithmic-regime giant component misses vertices; exchangeability and a union bound show that none are marked. The label coupling then transfers the two assertions to the process.
MCAR auxiliary-variable efficiency 2026-10-06
With a fully observed covariate , response , and an independent response indicator with probability , let . A covariate-standardized mean has asymptotic variance , whereas the complete-case mean has variance . The difference is . Thus missing completely at random does not justify discarding predictive observed covariates on efficiency grounds.
With one initial ancestor and independent offspring counts of finite mean and variance, conditioning on the current generation gives the displayed recurrences. For the variance is for positive generation index. At it is . At zero offspring mean the distribution is concentrated at zero and later generations vanish. These formulas are for the Galton-Watson process, not arbitrary dependent reproduction.
Meta-analysis Created 2026-10-05 Updated 2026-10-06
A meta-analysis combines statistical evidence from several studies addressing a common estimand. It may assume a shared effect or use a random-effects meta-analysis to represent between-study variation. Inverse-variance weighted means combine independent effect estimates when their variances are known or estimated; differences in study validity and effect modifiers require substantive assessment, not just weighting.
Minimum-variance importance distribution 2026-10-06
For and , the proposal minimizes the variance of the ordinary unbiased importance sampling estimator. The Cauchy-Schwarz inequality gives , so the minimum variance for independent samples is . The proposal need only cover the nonzero integrand.
For per-capita birth and death rates and , the rates are and . If and , thenThe expected value sees only the net growth rate , whereas the variance also sees the total event rate .
Multiple-imputation confidence interval 2026-10-06
Use the pooled estimate and total variance from Rubin's rules. A basic large-complete-sample scalar interval is , with for . Small complete-data samples need an appropriate degrees-of-freedom adjustment; the normal limit applies as the available degrees of freedom become large.
Normal approximation 2026-10-05
A normal approximation replaces a sampling distribution by a normal distribution, often through a central limit theorem. In a Wald test, approximate statistical power is determined by the standardized difference under the alternative. This yields Neyman allocation for fixed treatment-specific variances.
Normal-inverse-gamma prior Created 2026-10-05 Updated 2026-10-06
For a normal linear model with coefficient vector and residual variance , a normal-inverse-gamma prior has and , with a positive-definite matrix and . The inverse-gamma density is proportional to . Multiplying by the normal linear model likelihood function and completing the square preserves the family, giving an analytic posterior and evidence integral.