A Graph-Theoretic Approach to Randomization Tests of Causal Effects Under General Interference
David Puelz, Guillaume Basse, Avi Feller, Panos Toulis

TL;DR
This paper introduces a graph-theoretic method for valid randomization tests of causal effects under general interference, enabling analysis in complex settings with arbitrary interference patterns.
Contribution
It proposes a novel approach using bipartite graph bicliques to identify sharp null hypotheses, improving power and scalability over existing methods.
Findings
Effective in clustered interference settings
Applied successfully to a large-scale policing experiment
Outperforms specialized methods in complex interference scenarios
Abstract
Interference exists when a unit's outcome depends on another unit's treatment assignment. For example, intensive policing on one street could have a spillover effect on neighboring streets. Classical randomization tests typically break down in this setting because many null hypotheses of interest are no longer sharp under interference. A promising alternative is to instead construct a conditional randomization test on a subset of units and assignments for which a given null hypothesis is sharp. Finding these subsets is challenging, however, and existing methods are limited to special cases or have limited power. In this paper, we propose valid and easy-to-implement randomization tests for a general class of null hypotheses under arbitrary interference between units. Our key idea is to represent the hypothesis of interest as a bipartite graph between units and assignments, and to find an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
