Randomized Graph Cluster Randomization

09/04/2020
by   Johan Ugander, et al.
0

The global average treatment effect (GATE) is a primary quantity of interest in the study of causal inference under network interference. With a correctly specified exposure model of the interference, the Horvitz-Thompson (HT) and Hájek estimators of the GATE are unbiased and consistent, respectively, yet known to exhibit extreme variance under many designs and in many settings of interest. With a fixed clustering of the interference graph, graph cluster randomization (GCR) designs have been shown to greatly reduce variance compared to node-level random assignment, but even so the variance is still often prohibitively large. In this work we propose a randomized version of the GCR design, descriptively named randomized graph cluster randomization (RGCR), which uses a random clustering rather than a single fixed clustering. By considering an ensemble of many different cluster assignments, this design avoids a key problem with GCR where a given node is sometimes "lucky" or "unlucky" in a given clustering. We propose two randomized graph decomposition algorithms for use with RGCR, randomized 3-net and 1-hop-max, adapted from prior work on multiway graph cut problems. When integrating over their own randomness, these algorithms furnish network exposure probabilities that can be estimated efficiently. We develop upper bounds on the variance of the HT estimator of the GATE under assumptions on the metric structure of the interference graph. Where the best known variance upper bound for the HT estimator under a GCR design is exponential in the parameters of the metric structure, we give a comparable variance upper bound under RGCR that is instead polynomial in the same parameters. We provide extensive simulations comparing RGCR and GCR designs, observing substantial reductions in the mean squared error for both HT and Hájek estimators of the GATE in a variety of settings.

READ FULL TEXT

page 40

page 41

research
10/18/2018

A systematic investigation of classical causal inference strategies under mis-specification due to network interference

We systematically investigate issues due to mis-specification that arise...
research
03/18/2022

Optimizing Randomized and Deterministic Saturation Designs under Interference

Randomized saturation designs are a family of designs which assign a pos...
research
01/28/2021

Experimentation for Homogenous Policy Change

When the Stable Unit Treatment Value Assumption (SUTVA) is violated and ...
research
05/29/2022

Graph Agnostic Estimators with Staggered Rollout Designs under Network Interference

Randomized experiments are widely used to estimate causal effects across...
research
02/10/2023

Model-Based Regression Adjustment with Model-Free Covariates for Network Interference

When estimating a Global Average Treatment Effect (GATE) under network i...
research
12/03/2021

Optimized variance estimation under interference and complex experimental designs

Unbiased and consistent variance estimators generally do not exist for d...
research
06/26/2020

Properties of restricted randomization with implications for experimental design

Recently, there as been an increasing interest in the use of heavily res...

Please sign up or login with your details

Forgot password? Click here to reset