Designs for estimating the treatment effect in networks with interference

From MaRDI portal
Publication:2196188

DOI10.1214/18-AOS1807zbMATH Open1453.62611arXiv1705.08524MaRDI QIDQ2196188FDOQ2196188


Authors: Ravi Jagadeesan, Natesh S. Pillai, Alexander Volfovsky Edit this on Wikidata


Publication date: 28 August 2020

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: In this paper we introduce new, easily implementable designs for drawing causal inference from randomized experiments on networks with interference. Inspired by the idea of matching in observational studies, we introduce the notion of considering a treatment assignment as a quasi-coloring" on a graph. Our idea of a perfect quasi-coloring strives to match every treated unit on a given network with a distinct control unit that has identical number of treated and control neighbors. For a wide range of interference functions encountered in applications, we show both by theory and simulations that the classical Neymanian estimator for the direct effect has desirable properties for our designs. This further extends to settings where homophily is present in addition to interference.


Full work available at URL: https://arxiv.org/abs/1705.08524




Recommendations




Cites Work


Cited In (14)





This page was built for publication: Designs for estimating the treatment effect in networks with interference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196188)