Binomial thinning 2026-10-31
Retain each of objects independently with probability , independently of the nonnegative integer-valued random variable . The retained count has the displayed conditional binomial distribution. The probability generating function of an independent random sum gives . If has finite variance, the law of total expectation and law of total variance give
The first term is the average conditional variance of the independent retention decisions; the second is the variance in their conditional expected value.
Conditional Monte Carlo Created 2026-10-06 Updated 2026-10-14
Replacing a simulated quantity by preserves its expectation and reduces variance by the law of total variance. This is Rao-Blackwellization. For a random sum, conditioning on the count and all but one summand replaces an event indicator by a cumulative distribution function evaluation. The resulting estimator needs that conditional expectation to be computable.
Conditional variance Created 2026-09-28 Updated 2026-10-14
The conditional variance measures the remaining squared uncertainty after specified information has been used to form a conditional mean. For a real square-integrable random variable and a sub-sigma-algebra , let . Then
It is a -measurable random variable, nonnegative almost surely, rather than necessarily a single number. With the information , its value is the variance in the group identified by . Its expected value is the mean squared error of predicting by its conditional mean.[ref]
In the exact mixture distribution in law of total expectation, group contains around mean two, and group contains around mean eight. Both groups have conditional variance four because their deviations from their own means are with equal probabilities. Therefore . Meanwhile, the two group means have variance . The law of total variance gives
Direct calculation gives and , checking the decomposition.
Figure 1.
Total variance separates remaining within-group error from variation of group means
. Left: in the stipulated finite mixture distribution, each group's values deviate by from its conditional mean. Right: the total variance separates into expected conditional variance four and variance of the conditional mean . Knowing the group removes the latter part from the average squared prediction error. Values and weights are exact model choices, not measured data. Details.
For any square-integrable -measurable predictor , the error identity is
The cross term vanishes because . Thus using the conditional mean minimizes mean squared error, while conditional variance quantifies what this information still cannot predict. This is the orthogonal projection interpretation in L2 space.[ref]
Independent marking is the hypothesis that guarantees the Poisson thinning theorem. Equal marginal retention probabilities do not guarantee it. Consider one Bernoulli random variable with success probability , independent of a Poisson process, and retain every arrival when and none when . Each arrival is retained with probability , but the marks share the same coin. In an interval whose original count has Poisson distribution of mean , the retained count is and the rejected count is , so
The extra variance shows that is not Poisson distributed; the negative covariance proves dependence. Its no-arrival probability is , rather than . For the toy values , both rules have retained mean , but the common-coin rule has variance and no-arrival probability , compared with variance and no-arrival probability for independent marking. These formulas follow by conditioning on and using the law of total variance.
An arrival-dependent or adversarial retention rule can change the law just as strongly. Keeping every second arrival gives . Its successive retained gaps are sums of two independent exponential random variables, hence have the Erlang distribution of shape two and rate , not an exponential distribution. The resulting renewal process and its count variance are analyzed in Every second Poisson arrival has underdispersed counts, and the two dependent streams in alternating split of a Poisson process. As an even more restrictive rule, keeping only the first arrival ever gives , a Bernoulli distribution at each , so it cannot have a positive-mean Poisson distribution. A thinning rule must specify how decisions depend on arrivals and on one another; the independent-marking conclusion cannot be applied automatically to arbitrary deletion.
For a binary disease trait with genotype , the genetic variance of penetrance is the between-genotype term in the law of total variance. The averaged within-genotype term is . Under multiplicative diallelic penetrance, the genetic term is . This decomposition attributes variance to the modeled locus, not automatically to all hereditary causes.
Let and for the conditional distributions of parahydrogen and orthohydrogen, with . Differentiating the normalized Boltzmann factors gives . Thus the rotational heat capacity at constant volume per molecule of a composition frozen at is
At conversion equilibrium, the law of total variance adds a nonnegative contribution from the changing species populations:
The last term is the contribution from conversion. Compare the first two terms with a frozen sample at the same instantaneous composition; a frozen sample generally has different weights too. This formula follows directly from the variance of a mixture: subtract the overall mean inside each species, expand the square, and the cross terms vanish because each conditional deviation has zero mean. It also proves nonnegative rotational heat capacity in either model.
Figure 1. . Original numerical sums of the stated linear rigid rotor model through . The upper panel compares the equilibrium orthohydrogen fraction with frozen normal hydrogen; the lower panel also shows pure parahydrogen. These are dimensionless predictions, not experimental curves. Only internal molecular rotation contributes: translation, molecular vibration, interactions between molecules, and external-field splittings are omitted. Details.
For an original worked example at , summing the allowed ladders gives , , and . The calculated rotational heat capacities are and for frozen normal hydrogen. The contrast is large because changing species accesses the to separation, whereas fixed species must use the larger to or to separations. These are model numbers at a chosen dimensionless temperature, not measured hydrogen data.
Both rotational heat capacities approach zero as , although frozen normal hydrogen retains nonzero rotational internal energy. Both approach as within the rotor model. The high-temperature limit is a formal limit with all other excitations suppressed; actual molecular hydrogen eventually needs molecular vibration, nonrigidity, and dissociation. Multiplying the per-molecule result by the Avogadro constant gives rotational molar heat capacity in units of the molar gas constant . A dilute classical ideal gas additionally contributes from translation to its heat capacity at constant volume.
Law of total expectation Created 2026-09-24 Updated 2026-10-14
The law of total expectation makes averaging in stages reliable, provided the outer stage uses the actual probabilities of the groups. For an integrable random variable and a sub-sigma-algebra ,
Replacing each outcome by its group's conditional mean preserves the overall expected value. In the definition of conditional expectation, take the event to obtain this identity.[ref]
For a complete finite example, choose a group with probability and with probability . Within group , is or with equal conditional probabilities; within group , it is or with equal conditional probabilities. Thus the joint probability distribution puts probabilities on . The conditional means are two and eight. Consequently,
Direct averaging of the four values gives the same . Taking the unweighted average of the two group means instead gives five, which describes a different choice of group probabilities. This is why the outer weighting matters.
Figure 1.
Group averages preserve the overall mean when weighted by group probabilities
. The stipulated joint probability distribution assigns probabilities to values in groups . The conditional means are two and eight, occurring with probabilities and . Both representations have expected value . The unweighted average of the group means, five, is shown separately as the result of different weighting. These are exact illustrative probabilities, not observations. Details.
The formula is useful when conditioning on a first choice makes the remaining experiment simple. It can replace a large outcome enumeration by smaller calculations within groups. In a mixture distribution, it combines component means using mixture weights; in a random sum of independent claims, it separates the number of summands from their individual expected values under the stated independence assumptions. The same averaging step appears in the law of total variance.
Law of total variance Created 2026-09-24 Updated 2026-10-14
The law of total variance separates the spread of a population into spread inside groups and spread between their means. For a real square-integrable random variable , so that , and another random variable on the same probability space,
The first term averages the conditional variance over the possible information ; the second measures how much the conditional mean changes with that information. There is no independence assumption, and need not be numerical or have finite variance. Conditioning is useful precisely when knowing tells us something about . See MIT tutorial on using conditional expectation and variance.
More generally, the available information can be a sub-sigma-algebra of the ambient probability space. With , the existing conditional expectation definition gives
Taking recovers the displayed formula. The conditional mean and conditional variance are themselves random variables: before learning the group, we do not yet know which group average or group spread will apply. Their outer expectation and variance turn these varying quantities into numbers.
For a fully explicit mixture distribution, choose a group or with equal probabilities. In group , choose or with equal conditional probabilities; in group , choose or with equal conditional probabilities. Thus the complete joint probability distribution consists of , each with probability , and no other outcomes. The conditional means are and . Squaring the deviations and gives conditional variances and , respectively. The law of total expectation gives the overall mean .
The within-group contribution to variance is
For the between-group contribution, the conditional mean takes values and , each three units from the overall mean. Consequently,
We can check this without any conditioning: the discrete random variable takes values with equal probabilities, so
Equivalently, its second moment is , and subtracting the squared mean gives . These are population variances, with the stated probabilities as weights, rather than estimates using the corrected denominator of a sample variance.
Figure 1.
Four equally likely outcomes split total variance into within-group 5 and between-group 9
. Details.
The figure makes the two sources of spread visible. The outcomes in group cluster tightly around , while those in group sit farther apart around . Replacing every outcome by its conditional mean removes the internal spread but leaves the separation between groups. Conversely, subtracting each group's conditional mean aligns the two groups around zero. Averaging only the conditional variances would miss nine units of variance; retaining only the conditional means would miss five. Neither summary alone describes the whole population.
Two modifications clarify what each contribution measures. Shift group to outcomes and group to outcomes , keeping all four probabilities equal. Both conditional means are now , while the conditional variances remain . The between-group contribution vanishes, and total variance is just . Group membership still tells us how uncertain an outcome is, even though the best point prediction stays the same. Alternatively, let every outcome in group equal and every outcome in group equal . Now both conditional variances vanish, and all nine units of total variance come from group separation. Knowing the group predicts the outcome perfectly. These limiting cases distinguish differences in average outcome from differences in internal spread; the original mixture distribution contains both.
The same calculation answers a prediction question. If the group is hidden, the best constant prediction is the overall mean , with mean squared error , by variance as the minimum mean squared error of a constant. If the group is revealed, predict for and for . The errors become , and their mean squared error is . Knowing the group therefore improves the best achievable mean squared error by , exactly the between-group contribution. This is an interpretation relative to the information available: the remaining uncertainty could shrink further if additional information were revealed.
For any square-integrable measurable function used as a predictor, write . The prediction identity is
Thus predicting with the regression function gives the conditional expectation and minimizes mean squared error over every permitted predictor, including nonlinear ones. This minimizes average squared error, not the error for each individual outcome. See Berkeley Statistics 201A notes, sections 36–37.
Why do the two pieces add cleanly? Put . Its conditional expectation given is zero, so and for every square-integrable measurable function . In particular, and are uncorrelated random variables. Splitting and squaring therefore leaves no cross term after taking expectation. Geometrically, the conditional expectation is an orthogonal projection in the L2 space, and the law of total variance is its Pythagorean theorem for centered random variables.
Figure 2.
Conditional prediction leaves zero group means but different residual spreads
. Details.
In our example, the four products are , which average to zero. Yet and are not independent: observing identifies group , while observing identifies group . This is a concrete instance of heteroscedasticity, with different conditional variances despite zero conditional means of the errors. A group can predict uncertainty even when it cannot predict the error's sign.
The law of total variance is useful whenever aggregated data conceal distinct groups. Changing mixture weights changes both contributions, so the weighting must match the population being described. For example, giving group weight changes the overall mean to , the within-group variance contribution to , and the between-group contribution to , making the total . Group differences account for spread and prediction gains; assigning them a causal explanation requires a separate causal inference argument.
Let , and . With probability , take ; otherwise draw an exponential distribution of rate . This mixed probability distribution has a negative atom and a continuous nonnegative component. Its moments are and . The law of total variance equivalently gives .
When , conditioning on selects exactly the exponential component, so for . An ordinary probability density function for the continuous component integrates to , not one; the missing mass is the atom, not a normalization error.
Random multiplication increases the noise relative to deterministic gain. If the output from one input electron has mean and variance , a Poisson distribution of input electrons with mean produces output variance , by the law of total variance. The high-gain analog-mode excess-noise factor is .
Let have a Poisson distribution with parameter , and let be independent random variables with a Poisson distribution of common parameter , independent also of . Then has a compound Poisson distribution, with . The law of total expectation yields the displayed probability generating function and expected value . The law of total variance gives variance , exceeding the mean when both parameters are positive. This extra variation comes from the random number of groups. Jerzy Neyman is the statistician for whom the distribution is named.
If has Poisson mean , conditional expectation and the law of total variance give the display. A positive variance of the random mean prevents the unconditional count from being Poisson. For Poisson parents of density and offspring mean , the count in has excess variance , which is positive for a bounded positive-area set and a nontrivial model.
Let have finite variance and mean . An independent-sample Monte Carlo estimator has variance , so its root-mean-square random error is . Three techniques reduce the variance coefficient rather than changing this ordinary rate.
For antithetic variates, couple with and average the pair. With independent pairs, the variance is , compared with for independent function evaluations. If is monotone in a scalar uniform, the covariance is nonpositive: for independent uniforms ,
Opposite fluctuations therefore cancel. The reduction factor at equal evaluation count is , where is the paired correlation coefficient; it can approach zero, but positive covariance would make the method worse. This is appropriate for monotone or otherwise negatively coupled payoffs, with cheap complementary paths.
For control variates, use a jointly simulated with known mean and average . It remains an unbiased estimator for fixed , and
Completing the square gives and minimal variance . For contingent claim simulation, an analytically priced related financial payoff, such as a simpler option or discounted terminal stock, can be a useful control. It works best when correlation has large absolute value and simulation of the control adds little cost. A coefficient fixed from an independent pilot keeps the elementary unbiasedness argument valid; estimating it from the same sample can introduce finite-sample bias.
For stratified sampling, partition the sampling space into strata of probabilities , and independently simulate samples conditional on each stratum. The estimator is unbiased and has variance
With proportional allocation , ignoring integer rounding, this equals . The law of total variance shows the reduction from ordinary sampling is : fixed representation removes randomness in the stratum counts. At equal per-draw cost, minimizing the displayed variance gives and minimum for positive within-stratum variances. This follows by Cauchy-Schwarz inequality and is useful when a low-dimensional coordinate strongly predicts the financial payoff and conditional simulation is easy.
There is no universal ranking. At comparable cost the variance factors depend respectively on paired covariance, squared control correlation, and within-stratum variation. A nearly perfect control can outperform a weak antithetic pair; an appropriate stratification can be almost exact for a nearly stratum-constant financial payoff. Extra construction and sampling costs must be included in a fair accuracy comparison, and the methods can be combined.
Where the moment-generating function is finite in a neighborhood of zero, define the cumulant-generating function and the th cumulant by . Differentiation gives
since . Thus the first two cumulants are the mean and variance.
Conditional on , independence gives . Summing over the Poisson distribution yields
Hence the compound Poisson cumulants give
For the moment statements, finite second moments suffice even when a moment-generating function does not exist near zero: conditioning gives . This distinguishes the raw second moment from the variance of an individual claim.
For a single flood, the law of total expectation and law of total variance similarly give
Condition on the number of floods and apply the same laws once more. All floods have these moments and are independent of , so the annual total satisfies
The additional term is the variation in the number of entire flood clusters; it would be lost by treating individual claims as an ordinary Poisson stream.
For the annual count , its probability generating function is
This is the nested Poisson flood count. Differentiating, or conditioning on , gives and . Thus is not Poisson when , since its variance exceeds its mean. If either parameter is zero it is identically zero, a degenerate Poisson distribution.
Let be the number of valid claims in flood . Independent validity marking gives . Its generating function is
so Poisson thinning gives . With validity independent also of claim amount, each claim contributes expected paid amount . Therefore the annual expected payment is . The independent-mark assumption is needed for this multiplication; a size-dependent invalidity rule would require the joint expected value of amount and validity instead.
A credibility factor is the weight assigned to a particular risk's observed experience when blending it with a population or manual premium. In the Bühlmann model, the blend is the best affine mean-square predictor, rather than automatically the full posterior mean.
Let , the expected process variance, and assume the displayed second moments are finite. The law of total expectation gives . The law of total variance and law of total covariance give
For the second formula, the conditional covariance is zero by conditional independence, while the covariance of the conditional means is , the variance of hypothetical means. Likewise
because .
To derive the Bühlmann credibility premium, minimize . Differentiating in sets the predictor's mean to . The remaining normal equations are
For , subtracting any two rows forces all to be equal, then gives . Thus the premium and factor are
The same affine premium predicts : conditional independence makes , so minimizers agree. If , every year's amount equals almost surely, and gives the exact risk mean even though the coefficient vector need not be unique.
For fixed , . Thus more within-risk variation decreases credibility: individual experience becomes less informative, as , and the premium tends to . Increasing the number of observed years has the opposite effect.
For numerical estimation from a balanced panel, assume the risks are independent draws from the same risk population, with comparable exposures, and . Set
Conditionally, each within-risk sample variance has mean ; hence . The risk sample means have variance , so . Therefore is an unbiased method of moments estimate of . For a usable nonnegative variance estimate take , noting that this truncation sacrifices exact unbiasedness.
The balanced-panel method-of-moments credibility estimate for risk is consequently
If and , use zero credibility. If both estimates are zero, the within and between sums of squares are zero and all the observed amounts coincide; any blend gives that same premium. With only one year per risk or only one risk, these within/between estimators are unavailable, so external structural estimates or additional assumptions are necessary.
In the Bühlmann model, one policy has a random risk parameter . Conditional on , its annual observations are independent and identically distributed random variables, with mean and variance . Put , let be the expected process variance, and let be the variance of hypothetical means. Assume the required second moments are finite.
The Bühlmann credibility premium is the best affine estimate of under mean squared error. After choosing the intercept to make the estimate unbiased, write it as . If , the law of total variance and conditional independence give its error
For fixed , the Cauchy-Schwarz inequality minimizes the last sum at . Differentiating gives . Thus the credibility factor and credibility premium are
The ratio form assumes ; when and , the conditional mean is constant and . Predicting rather than its conditional mean adds the constant to the error and leaves the optimal affine estimate unchanged.
Here the latent intensity has a Pareto distribution with shape three and lower bound one. For , its moments are . Consequently
The equality for uses the Poisson distribution conditional variance . There are two years of experience, so and the observed sample mean is . The Poisson credibility with a shape-three Pareto intensity is therefore
In particular it equals when .
For the exact Bayesian credibility estimate, the total count conditional on has Poisson distribution of mean . Multiplication of its likelihood by the prior distribution density gives a Bayesian posterior density proportional to on . At , its normalizing integral and first-moment integral are
Hence the next-year predictive expected value is
The Bühlmann credibility premium optimizes over affine estimates, whereas the Bayesian posterior mean optimizes over all square-integrable estimates. This explains why the two credibility estimates need not agree for this nonconjugate prior.
The first approach specifies marginal means, variances and an exchangeable correlation for each student's repeated counts. It is a moment model suitable for a generalized estimating equation; equality of the mean and variance alone does not specify a full Poisson joint distribution. Different students supply independent sampling clusters, while the three counts within a student are dependent.
The second approach is a Poisson generalized linear mixed model with a positive shared random multiplier . Conditional on it, the three counts are independent Poisson variables; integrating over it gives a fully specified dependent joint law. The gamma random-intercept Poisson model uses Gamma shape and rate , so and . Treat the covariates as fixed, with the same multiplier distribution across covariate/treatment groups, as required by this model.
Let and . The law of total expectation, law of total variance and law of total covariance give
Thus each marginal is a negative binomial distribution by the Poisson-gamma mixture, rather than generally a Poisson variable. Put . Its variance is , and the marginal correlation is
It is positive but usually depends on the two marginal means, so it need not be the common exchangeable correlation proposed in the first approach. The first method focuses on population mean effects with a chosen working correlation matrix; the second models latent student heterogeneity and separates conditional Poisson variation from additional marginal variation. Correctly specified likelihood inference for the second uses more distributional assumptions, while the first can retain valid mean inference despite a wrong working covariance by using a cluster-level sandwich variance.
Since the binary trait has marginal Bernoulli distribution with probability , its total variance is
Within a specified genotype , the conditional variance is . The within-genotype contribution to total variance is its average over the population:
Another Hardy-Weinberg equilibrium average gives
Hence
By the law of total variance, the remaining between-genotype component is the genetic variance of penetrance, namely
It is nonnegative, as a variance must be. It also follows from . The single-genotype variance and its population average are different quantities; both have been specified.
The Rao-Blackwell theorem states that if an estimator has finite second moment and is a sufficient statistic, then can be chosen without knowing the parameter. It has the same expectation as and no larger variance. In particular an unbiased estimator remains unbiased and its squared-error risk cannot increase. Sufficiency makes the conditional distribution, hence the function of used here, parameter-independent.
The tower property gives . The law of total variance gives
so the variance decreases, with equality exactly when is already a function of almost surely. Since the bias is unchanged, the same identity proves the squared-error risk claim. More generally the corresponding convex-loss inequality follows from conditional Jensen's inequality.
For the given geometric distribution, the joint mass is on positive-integer sample vectors. Thus is a one-dimensional sufficient statistic. Directly, conditional on , every positive-integer composition of into parts has the same probability; there are such compositions, independently of .
The simple estimator is unbiased for , since . For , compositions with are counted by subtracting one from their first part, giving when . Consequently the Rao-Blackwell estimator of a geometric failure probability is
At its value is zero, as it must be when all observations are one. For the possible one-observation case, use ; the displayed fraction would otherwise be undefined at . The conditional-expectation argument proves unbiasedness without needing to sum the negative-binomial mass explicitly.
For , let be the probability law of a seed displacement from its tree. For the literal circular support, it is normalized arclength on . The conditional mean measure of a point process is
We prove the conditional Poisson assertion directly by joint probability generating functions.
Fix disjoint bounded measurable sets . For a tree at , put and . Conditional on its seed count, the allocation among these sets and their complement is multinomial distribution. Averaging over the Poisson seed count gives
Thus this tree contributes independent Poisson counts of means to the disjoint sets. Different trees contribute independently. Only trees within distance of the bounded union of the can contribute, and there are almost surely finitely many of them. Multiplying their probability generating functions gives
This is precisely the joint probability generating function of independent Poisson counts with the displayed means. Also is locally finite, because each bounded set can receive seeds from only finitely many trees. This proves the conditional Poisson point process assertion and the Poisson offspring clusters directed by their parent process construction.
In arclength notation the directing measure is , where is arclength on the circle centered at . If “circle” is used to mean the filled disc instead, take ; then
The generating-function proof and the following unconditional conclusion hold for either reading. The circular version has a singular conditional directing measure, giving the random directing measure of a Cox process formulation.
Unconditionally this is a Cox process, specifically a Poisson-offspring Neyman-Scott process. Its mean measure of a point process is nevertheless spatially uniform. With , the Campbell first-moment formula and translation invariance give
since . Uniform mean alone does not establish a Poisson law.
For a bounded set of positive area, the conditional count has mean and variance . The law of total variance gives
A Poisson integral of a deterministic function has variance : for a simple function on disjoint sets this follows from independent Poisson counts, and square-integrable approximation gives the general formula. Here and it has bounded support, so
The strict inequality holds when , because implies . A Poisson random variable has equal mean and variance. Hence the unconditional process is not a Poisson process in the nontrivial model. If or , there are no seeds and the process is the degenerate empty Poisson process. The overdispersion of nondegenerate mixed Poisson counts quantifies the additional clustering induced by the random parents.