Enregistré dans:
Détails bibliographiques
Auteurs principaux: Park, Bryan, Wager, Stefan
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:https://arxiv.org/abs/2603.25032
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866912983007887360
author Park, Bryan
Wager, Stefan
author_facet Park, Bryan
Wager, Stefan
contents Under network interference, the treatment given to one unit may also affect the outcomes of its neighboring units in an exposure graph. Existing large-sample theory has focused on settings where either the exposure graph is sparse, or the exposure graph is randomly generated using a random graph model. The question of how to analyze treatment effect estimation in network interference models with dense, non-random exposure graphs has remained open to date. Here, we address this gap and prove a central limit theorem for possibly dense, non-random models by extending the graph limit framework pioneered by Lovász and Szegedy to the setting of causal inference under network interference. Our result implies that the uncertainty for average direct effect estimation is to first-order driven by random treatment assignment, and so asymptotic results derived under the random graph model correctly predict statistical behavior in non-random network interference designs.
format Preprint
id arxiv_https___arxiv_org_abs_2603_25032
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Treatment effect estimation under convergent network interference
Park, Bryan
Wager, Stefan
Statistics Theory
Under network interference, the treatment given to one unit may also affect the outcomes of its neighboring units in an exposure graph. Existing large-sample theory has focused on settings where either the exposure graph is sparse, or the exposure graph is randomly generated using a random graph model. The question of how to analyze treatment effect estimation in network interference models with dense, non-random exposure graphs has remained open to date. Here, we address this gap and prove a central limit theorem for possibly dense, non-random models by extending the graph limit framework pioneered by Lovász and Szegedy to the setting of causal inference under network interference. Our result implies that the uncertainty for average direct effect estimation is to first-order driven by random treatment assignment, and so asymptotic results derived under the random graph model correctly predict statistical behavior in non-random network interference designs.
title Treatment effect estimation under convergent network interference
topic Statistics Theory
url https://arxiv.org/abs/2603.25032