Randomized experiments on networks are complicated by interference: treating one unit can affect others through multi-hop spillovers. Cascade-Based Randomization (CasBR) generates treatment assignments according to the Independent Cascade (IC) model a...
Randomized experiments on networks are complicated by interference: treating one unit can affect others through multi-hop spillovers. Cascade-Based Randomization (CasBR) generates treatment assignments according to the Independent Cascade (IC) model and yields design-unbiased estimation of the Total Treatment Effect (TTE), but it does not explicitly enforce covariate balance or restrict treated-control connections that create unallowable peer effects. This thesis proposes Rerandomized Cascade-Based Randomization (ReCasBR), which conditions CasBR on joint balance constraints: covariate imbalance measured by the Mahalanobis distance M(Z) and cross-group connectivity measured by the number of treated-control edges B(Z). ReCasBR repeatedly samples CasBR assignments until M(Z) ≤ a and B(Z) ≤ b, with (a,b) set by empirical CasBR quantiles. Because both the base design and acceptance rule are label-symmetric, rerandomization preserves CasBR’s design-unbiasedness for TTE. Across synthetic graphs, ReCasBR consistently tightens joint balance relative to complete randomization, cluster-based randomization, and CasBR. On real networks, ReCasBR reduces cross-group edges and the need for bystander post-processing, and achieves lower TTE estimation error than competing designs.