M1-085M1: Mathematics & Statistics Fundamentals实验设计 (A/B)Hard
⚡Flashcard Drill➔Mastery:

Explain Why Individual Randomization Fails Under Network Spillover/Interference and How Cluster Randomization Solves It

🎯 Active Recall Self-Check (Draft First, Verify After)
Login-free practice tracker: recall core answer, audit pitfalls, and log review status.
Step 1 · Draft your concise answer & assumptions
Step 2 · Check Pitfalls & Follow-up Inquiries
Next: M1-086 →
📐 Mathematical Definition
SUTVA: Yi(Ti) 独立于 Tj (j≠i)\text{SUTVA}:\ Y_i(T_i)\ \text{独立于}\ T_j\ (j\ne i)
⚡ One-Sentence Core Answer
Individual randomization fails under network interference because treating a user spills over to affect their connected social peers, violating SUTVA and contaminating control group baseline measurements.

📌 Key Takeaways

  • •
    SUTVA Violation: In social networks (Meta, LinkedIn) or collaborative platforms (Slack, Figma), YiY_i depends not just on TiT_i, but on the treatment vector of friends TN(i)T_{\mathcal{N}(i)}.
  • •
    Direction of Bias: Direct network effects typically cause Treatment to elevate Control engagement (e.g. Chatting with untreated friends), severely diluting and underestimating the true treatment lift.
  • •
    Primary Mitigations: Graph Cluster Randomization (assigning tightly connected subgraphs to the same variant) and Ego-Network Randomization.

📐 Mathematical Derivations

Network potential outcomes model (Manski, 2013): Let Yi(t,s)Y_i(t, s) depend on individual treatment t∈{0,1}t \in \{0, 1\} and network exposure s=∑j∈N(i)Tj∣N(i)∣∈[0,1]s = \frac{\sum_{j \in \mathcal{N}(i)} T_j}{|\mathcal{N}(i)|} \in [0, 1]. Under individual Bernoulli randomization, control users are exposed to s>0s > 0. The observed difference in group means is: τ^naive=E[Yi(1,s)∣Ti=1]−E[Yi(0,s)∣Ti=0]\hat{\tau}_{\text{naive}} = E[Y_i(1, s) \mid T_i=1] - E[Y_i(0, s) \mid T_i=0]. However, the true total launch effect (Global Treatment Effect) is τglobal=E[Yi(1,1)]−E[Yi(0,0)]\tau_{\text{global}} = E[Y_i(1, 1)] - E[Y_i(0, 0)]. If positive spillovers exist (E[Y(0,s)]>E[Y(0,0)]E[Y(0, s)] > E[Y(0, 0)]), then τ^naive\hat{\tau}_{\text{naive}} systematically underestimates the true global product value.

🏭 Production Trade-offs

Cluster Randomization protocol: (1) Run graph partitioning algorithms (Louvain or spectral clustering) to segment the social graph into isolated clusters minimizing cut edges between clusters. (2) Randomize entire clusters to Treatment or Control. This ensures friends share the same treatment status, containing spillovers. Trade-off: Reduces effective degrees of freedom from millions of individual users down to the number of clusters KK, drastically inflating variance and requiring cluster-robust standard errors.
⚠️ Common Interview Pitfalls
  • ✕
    Using individual-level standard errors on cluster-randomized data (drastically inflates false positive rate; must cluster standard errors by cluster ID).
  • ✕
    Allowing large inter-cluster boundary edge cuts, which lets spillovers bleed across cluster boundaries.
🎯 Interviewer Follow-up Inquiries
  • ?
    How does the Exposure Model (Aronow & Samii, 2017) decompose network effects into direct and indirect spillover effects?
  • ?
    Why does graph modularity optimization (Louvain) maximize experimental power in network experiments?
⚡
Test muscle memory on this topic via 3-Layer Flashcards
Active Recall: Mentally formulate Prompt ➔ Math Derivation ➔ Benchmark Implementation in 3 minutes.
🎯 Drill This Card Now➔
📚

Associated Knowledge Base Guides & Mindmaps

← PreviousM1-084: Explain Switchback Experiments and Their Applications in Marketplace and Two-Sided Delivery Platforms📋 Back to BankNext →M1-086: Explain Trigger Analysis in Online Experiments and How It Enhances Statistical Power