CausalSmith · seminar slides
Random Groups and Finite-Population Variance
For fixed-size random group-formation experiments, we characterize the exact design variance and show when the equal-group CR2 cluster-robust variance statistic tracks the right scale.
slides for Random Group Formation and the Equal-group CR2 Variance in Finite Populations
Overview
- We study experiments where units are first formed into disjoint groups of a common size, then groups are assigned to treatment or control.
- The estimand is a finite-population average over all possible groups of that size.
- The realized groups are dependent because they are drawn without replacement from the same population.
- We express that dependence exactly using Kneser disjointness geometry.
- The equal-group CR2 statistic estimates the independent-group variance scale.
- The exact variance also contains a finite-population correction when grouped units occupy a positive population fraction.
Motivation
- Think of a peer-effect experiment that forms study groups of size M, the common group size.
- A unit’s outcome can depend on both treatment and the peers in its realized group.
- If many units are grouped, seeing one group removes its members from the pool available to other groups.
- That removal creates dependence across realized group outcomes.
- Standard cluster-robust logic treats groups as the sampling units.
- The design question is what that logic estimates after the groups themselves are randomly formed.
Research Question
- We want the exact design variance of the group-level treated-control difference in means.
- The target is the partition-average marginal effect τn, the finite-population average contrast over all possible groups of size M.
- The estimator τn compares treated and control realized group means.
- The variance target averages over both random group formation and balanced group treatment assignment.
- What correction is created by drawing disjoint groups from a finite population?
Setup
- The finite population has size n.
- The design draws Gn, the number of realized groups, as pairwise-disjoint groups of common size M.
- The grouped-unit count is Nn=MGn.
- The treated-group fraction is pn=G1n/Gn.
- The grouped-unit sampling fraction is Nn/n, with limit ρ.
- In the study-group example, ρ is the share of students placed into groups.
Assumptions
- The number of realized groups grows.
- The treated-group fraction converges to an interior limit.
- The grouped-unit sampling fraction converges to ρ∈[0,1], the limiting grouped-unit fraction.
- Potential outcomes are uniformly bounded.
- For ratio statements and lower bounds, the scaled exact variance stays away from zero.
The number of realized groups diverges: Gn→∞.
The treated-group fraction pn converges to an interior limit: pn→p∈(0,1).
The grouped-unit fraction Nn/n converges: nNn→ρ∈[0,1].
There is a finite uniform outcome envelope B such that n,i,z,Asup∣Yi,n(z,A)∣≤B<∞.
Estimand and Statistic
- For each treatment arm, hz,n(A) is the group mean potential outcome for candidate group A.
- The partition-average marginal effect averages h1,n(A)−h0,n(A) over the uniform slice of possible groups.
- The estimator is the treated-minus-control difference in realized group means.
- The scalar equal-group CR2 statistic is the sum of within-arm group-mean sample variances divided by arm group counts.
Define the finite-population partition-average marginal effect by τn=En[h1,n−h0,n]. The difference-in-means estimator across treated and control groups is τn=G1n1g∑Zngh1,n(Ang)−G0n1g∑(1−Zng)h0,n(Ang).
For each arm z, let sz,n2 be the within-arm sample variance of the observed group means, computed with denominator Gzn−1. Define the scalar equal-group CR2 variance statistic by VCR2,n=G1ns1,n2+G0ns0,n2.
Key Idea
- Random disjoint groups are sampled without replacement from the uniform slice.
- The Kneser operator averages a group table over groups disjoint from a given group.
- Johnson degrees decompose a group table into orthogonal finite-population components.
- Disjointness acts diagonally on those components.
- Degree one captures the part of the arm contrast tied to individual units’ marginal participation in groups.
Exact Geometry
informal · Theorem T-1 Disjoint-group covariance decomposes exactly by Johnson degree, with each degree weighted by its Kneser eigenvalue.
Let M,n∈N satisfy 2≤M and 2M≤n. Let Yi,n(z,A) be a deterministic potential-outcome schedule for units i∈A, arms z∈Z, and groups A∈Ωn,M, with group-level arm tables hz,n as in Definition P-2. Suppose the following conditions hold.
- (Johnson projections.) For each k=0,…,M, Πn,k is a linear projection on functions f:Ωn,M→R whose range is the degree-k Johnson harmonic subspace Hn,k, which fixes every element of Hn,k, and whose residual f−Πn,kf is orthogonal to Hn,k under the uniform-slice inner product ⟨u,v⟩n=En[u(A)v(A)].
- (Centered orthogonal decomposition.) For every f:Ωn,M→R and A∈Ωn,M, k=1∑MΠn,kf(A)=f(A)−Enf(A), and the projected components are mutually orthogonal: if k=ℓ, then ⟨Πn,kf,Πn,ℓg⟩n=0 for all f,g:Ωn,M→R.
- (Kneser spectrum.) For every k=0,…,M and every f∈Hn,k, the unnormalized Kneser adjacency operator has eigenvalue (−1)k(M−kn−M−k).
Then the normalized Kneser disjointness operator Kn acts on each projected component by Kn(Πn,kf)(A)=λn,kΠn,kf(A),λn,k=(−1)k(n−M)k(M)k, for every k=0,…,M, every f:Ωn,M→R, and every A∈Ωn,M. Moreover, if f,g:Ωn,M→R are centered under the uniform M-slice, then for a uniform ordered disjoint pair (A,C), Cov{f(A),g(C)}=k=1∑Mλn,k⟨Πn,kf,Πn,kg⟩n. Finally, the ordered-disjoint covariance of the arm-difference table satisfies Cττ,n=k=1∑Mλn,kΠn,k(h1,n−h0,n)n2.
Exact Variance
informal · Theorem T-2 The group-level difference in means is unbiased, and its exact design variance differs from expected equal-group CR2 by the Kneser covariance of the arm-difference table.
Let n,M,Gn,G1n be natural numbers and let G0n=Gn−G1n. Suppose that:
- (Feasible partition.) The two-stage random partition design in Definition P-1 is feasible: MGn≤n.
- (Group sizes.) 2≤M, 2≤G1n, and 2≤G0n.
- (Potential outcomes.) Yi,n(z,A) is a deterministic potential-outcome schedule, defined for every A∈Ωn,M, every i∈A, and every z∈Z.
Set Vz,n=VarA∼Unif(Ωn,M){hz,n(A)},Cab,n=EAEC∣C∩A=∅[ha,n∘(A)hb,n∘(C)], and Cττ,n=C11,n+C00,n−2C10,n,Rn=G1n/GnV1,n+1−G1n/GnV0,n. For the difference-in-means estimator τn, the finite-population PAME τn, the exact design variance σn2=Var(τn), and the scalar equal-group CR2 statistic VCR2,n in Definition P-7, E[τn]=τn, σn2=GnRn+Cττ,n−G1nC11,n−G0nC00,n, E[VCR2,n]=G1nV1,n−C11,n+G0nV0,n−C00,n, and E[VCR2,n]−σn2=−Cττ,n.
Dense Asymptotics
- In dense arrays, Gn grows while Nn/n converges to a possibly positive ρ.
- The independent-group scale is Rn.
- The dense correction is governed by Eτ,1,n, the degree-one Johnson energy of the arm-difference table.
- Higher Johnson degrees have a smaller pooled contribution under fixed M and bounded outcomes.
informal · Theorem T-3 Under the stated dense-array conditions, Gnσn2 is Rn−ρEτ,1,n up to a term that vanishes.
Fix a common group size M≥2 and real numbers p, ρ, and B. There is a constant C>0 such that, for every feasible triangular schedule array with common group size M and every rowwise choice of Johnson projections Πn,k on L2(Ωn,M), the following conditions imply the displayed limits below:
- (Group growth.) The array satisfies Assumption A-1.
- (Treatment fractions.) The array satisfies Assumption A-2 with limiting treated-group fraction p.
- (Sampling fractions.) The array satisfies Assumption A-3 with limiting grouped-unit fraction ρ.
- (Bounded outcomes.) The array satisfies Assumption A-4 with uniform outcome envelope B.
- (Johnson decomposition.) In every row with 2M≤n, the projections give the centered orthogonal Johnson decomposition k=1∑MΠn,kf(A)=f(A)−Enf for every f and every A∈Ωn,M, and distinct Johnson degrees are orthogonal under ⟨⋅,⋅⟩n.
- (Kneser spectrum.) In every row with 2M≤n, every f∈Hn,k is an eigenfunction of the unnormalized Kneser adjacency operator with eigenvalue (−1)k(M−kn−M−k).
Then Gnσn2−(Rn−ρEτ,1,n)→0, GnCττ,n+ρEτ,1,n→0, and pnC11,n+1−pnC00,n→0. Moreover, for every row n, the pooled contribution of Johnson degrees k≥2, Gnk=2∑Mλn,kΠn,k(h1,n−h0,n)n2, has absolute value at most C/n.
CR2 Frontier
- Equal-group CR2 estimates Rn/Gn, the independent-group variance scale.
- The exact variance subtracts the dense correction.
- Thus the one-sided conservativeness statement is a direct consequence of the projection expansion.
- Ratio consistency is characterized by the correction’s size relative to the corrected variance scale.
informal · Theorem T-4 Under the dense bounded schedule class, CR2 is asymptotically conservative in the stated one-sided probability sense and is ratio-consistent exactly when the dense correction is negligible.
Let M≥2, and let A be a triangular array of feasible random-group experiment rows with population sizes n, group counts Gn>0, treated-group counts 0<G1n<Gn, grouped-unit counts Nn=MGn≤n, and deterministic potential-outcome schedules. Fix constants p,ρ,B,cσ∈R. Suppose that:
- (Dense array.) The array A belongs to the dense bounded schedule class Cdense in Definition P-8, with parameters p,ρ,B,cσ.
- (Johnson projections.) For every row n, the spaces L2(Ωn,M) are equipped with linear projections Πn,k, 0≤k≤M, whose ranges are the degree-k Johnson harmonic subspaces Hn,k, which fix functions in their ranges and have residuals orthogonal to Hn,k under ⟨⋅,⋅⟩n.
- (Orthogonal decomposition.) For every row with 2M≤n, every f∈L2(Ωn,M), and every A∈Ωn,M, k=1∑MΠn,kf(A)=f(A)−Enf, and distinct Johnson components are orthogonal: ⟨Πn,kf,Πn,ℓg⟩n=0whenever k=ℓ.
- (Kneser spectrum.) For every row with 2M≤n, every 0≤k≤M, and every f∈Hn,k, the unnormalized Kneser adjacency operator satisfies C∩A=∅∑f(C)=(−1)k(M−kn−M−k)f(A).
Then, as n→∞, GnVCR2,n−Rnp0 and Gn(VCR2,n−σn2)−ρEτ,1,np0. Moreover, for every ε>0, Pr{VCR2,n/σn2<1−ε}⟶0, and the ratio VCR2,n/σn2 converges in probability to 1 if and only if Rn−ρEτ,1,nρEτ,1,n⟶0.
Sparse Regime
- When ρ=0, the first-order finite-population correction vanishes at the variance-ratio scale.
- This covers regimes where the grouped population share goes to zero.
- The named benchmark is Nn=M⌊n3/4/M⌋, for which Nn/n→0 while Nn2/n→∞.
- The study-group interpretation is that the grouped share becomes small, even if the number of realized groups grows quickly.
informal · Theorem T-5 For fixed M, zero limiting grouped-unit fraction gives CR2 ratio consistency, including the stated birthday-count benchmark.
Fix an integer M≥2. Then the following statements hold.
- (Sparse dense arrays.) For every feasible triangular schedule array with common group size M, if the array belongs to Cdense in Definition P-8 with limiting grouped-unit fraction ρ=0, then σn2VCR2,np1.
- (Birthday counts.) With Nnbd=M⌊Mn3/4⌋, the benchmark counts satisfy Nnbd≤n for all sufficiently large n, nNnbd→0,n(Nnbd)2→∞.
- (Birthday-aligned arrays.) For every feasible triangular schedule array with common group size M, if its grouped-unit count satisfies Nn=M⌊Mn3/4⌋ row by row and the array satisfies Assumption A-1, Assumption A-2, Assumption A-4, Assumption A-5 for some p, B, and cσ, then σn2VCR2,np1.
Related Literature
- The design-based foundation follows Splawa-Neyman et al. (1990), Fisher (1935), Cox (1958), Rubin (1974), and Holland (1986).
- The triangular-array and finite-population asymptotic language follows Hajek (1960), Cochran (1977), Ohlsson (1989), Fuller (2009), and Li and Ding (2017).
- The Johnson and Kneser tools come from Delsarte (1973), Brouwer et al. (1989), Filmus (2016), and Brouwer et al. (2018).
- CR2 connects to White (1980), Liang and Zeger (1986), Bell and McCaffrey (2002), Pustejovsky and Tipton (2018), and Abadie et al. (2023).
- The closest theorem-level comparison is Fu et al. (2026), where sparse whole-tuple conditions deliver CR2 ratio consistency.
Software and Witness
- The scalar statistic we analyze is the treatment-coordinate entry from a versioned equal-group
clubSandwichCR2 calculation. - The software identity ties the finite-population target to the regression workflow used in practice.
- The eight-unit witness gives a finite balanced design where exact variance and expected CR2 can be computed directly.
- In that witness, the exact variance is 1/7 and expected CR2 is 2/7.
informal · Theorem T-6 For the stated unweighted intercept-plus-treatment regression and versioned software call, the treatment-coordinate CR2 entry equals the scalar equal-group CR2 statistic.
informal · Theorem T-7 In the balanced eight-unit witness, the exact variance is 1/7 and the expected equal-group CR2 statistic is 2/7.
Lower-bound Intuition
- The lower bound compares two randomized schedule priors.
- In the same-sign prior, a unit carries the same sign across arms.
- In the independent-sign prior, a unit’s signs are drawn separately by arm.
- A single realization reveals only the assigned-arm outcomes.
- The observed-data mixture is the same for every statistic, while the exact variance limits separate when ρ>0.
Lower Bound
informal · Theorem T-8 At positive limiting grouped-unit fraction, the two Rademacher mixtures have equal one-realization expectations for every statistic while their scaled exact-variance limits differ by 2ρ/M.
informal · Theorem T-9 For the dense bounded schedule class, every measurable one-realization variance statistic has nonvanishing worst-case relative error with probability at least one half in the stated limit sense.
Fix a common group size M with 2≤M, and let A be a triangular schedule array with population sizes n, group counts Gn>0, treated-group counts 0<G1n<Gn, MGn≤n, and deterministic potential-outcome rows. Let p,ρ,B,cσ∈R. Suppose:
- (Envelope and fractions.) 0<ρ, 1≤B, and the array satisfies Assumption A-1, Assumption A-2, Assumption A-3 with limiting treated-group fraction p and limiting grouped-unit fraction ρ.
- (Johnson decomposition input.) For every row n, there are orthogonal projections Πn,k onto the degree-k Johnson harmonic spaces Hn,k, k=0,…,M, whose positive-degree components give the centered orthogonal decomposition of every f∈L2(Ωn,M): k=1∑MΠn,kf=f−Enf,⟨Πn,kf,Πn,ℓg⟩n=0for k=ℓ.
- (Kneser spectrum input.) For every row n with 2M≤n, the Kneser adjacency operator acts on f∈Hn,k by the eigenvalue (−1)k(M−kn−M−k),k=0,…,M.
- (Variance lower bound.) With dsame=Mp(1−p)1,dind=Mp(1−p)1−M2ρ, the constant cσ satisfies 0<cσ<dind.
Then there exist support sets Γnsame for the common-arm Rademacher prior Hnsame and Γnind for the independent-arm Rademacher prior Hnind such that both prior probabilities tend to one, every diagonal selection from either support induces an array in Cdense with parameters (p,ρ,B,cσ), the conditioned one-realization laws satisfy TV(Hnsame(On∈⋅∣Γnsame),Hnind(On∈⋅∣Γnind))→0, and the scaled exact variances converge uniformly on the respective supports: u∈ΓnsamesupGnσn2(u)−dsame→0,u∈ΓnindsupGnσn2(u)−dind→0. Moreover, there is an ε>0 such that every measurable one-realization variance statistic Sn(On) satisfies 21≤n→∞liminfY∈CdensesupYPr(σn2Sn(On)−1>ε).
Conclusion
- We give exact finite-sample variance identities for homogeneous random group formation.
- The Kneser covariance decomposition identifies the design dependence created by disjoint groups.
- The dense asymptotic expansion isolates ρEτ,1,n as the first-order correction to the independent-group scale.
- Equal-group CR2 estimates that independent-group scale and is ratio-consistent precisely under the stated correction criterion.
- At positive density, the lower bound explains why one realized grouping cannot uniformly recover the exact variance ratio over the full bounded schedule class.