« Back to Results

Network Interference

Paper Session

Friday, Jan. 3, 2025 2:30 PM - 4:30 PM (PST)

Hilton San Francisco Union Square, Union Square 13
Hosted By: Econometric Society
  • Chair: Eric Auerbach, Northwestern University

Graph Neural Networks for Causal Inference under Network Confounding

Michael P. Leung
,
University of California-Santa Cruz
Pantelis Loupos
,
University of California-Davis

Abstract

This paper studies causal inference with observational network data. A challenging aspect of this setting is the possibility of interference in both potential outcomes and selection into treatment, for example due to peer effects in either stage. We therefore consider a nonparametric setup in which both stages are reduced forms of simultaneous-equations models. This results in high-dimensional network confounding, where the network and covariates of all units constitute sources of selection bias. The literature predominantly assumes that confounding can be summarized by a known, low-dimensional function of these objects, and it is unclear what selection models justify common choices of functions. We show that graph neural networks (GNNs) are well suited to adjust for high-dimensional network confounding. We establish a network analog of approximate sparsity under primitive conditions on interference. This demonstrates that the model has low-dimensional structure that makes estimation feasible and justifies the use of shallow GNN architectures.

Causal Inference in Network Experiments: Regression-Based Analysis and Design-Based Properties

Mengsi Gao
,
University of California-Berkeley
Peng Ding
,
University of California-Berkeley

Abstract

Investigating interference or spillover effects among units is a central task in many social science problems. Network experiments are powerful tools for this task, which avoids endogeneity by randomly assigning treatments to units over networks. However, it is non-trivial to analyze network experiments properly without imposing strong modeling assumptions. Previously, many researchers have proposed sophisticated point estimators and standard errors for causal effects under network experiments. We further show that regression-based point estimators and standard errors can have strong theoretical guarantees if the regression functions and robust standard errors are carefully specified to accommodate the interference patterns under network experiments. We first recall a well-known result that the Ha ́jek estimator is numerically identical to the coefficient from the weighted-least-squares fit based on the inverse probability of the exposure mapping. Moreover, we demonstrate that the regression-based approach offers three notable advantages: its ease of implementation, the ability to derive standard errors through the same weighted-least-squares fit, and the capacity to integrate covariates into the analysis, thereby enhancing estimation efficiency. Furthermore, we analyze the asymptotic bias of the regression-based network-robust standard errors. Recognizing that the covariance estimator can be anti-conservative, we propose an adjusted covariance estimator to improve the empirical coverage rates. Although we focus on regression-based point estimators and standard errors, our theory holds under the design-based framework, which assumes that the randomness comes solely from the design of network experiments and allows for arbitrary misspecification of the regression models.

Causal Clustering: Design of Cluster Experiments under Network Interference

Davide Viviano
,
Harvard University
Lihua Lei
,
Stanford University
Guido Imbens
,
Stanford University
Brian Karrer
,
Meta Inc
Okke Schrijvers
,
Meta Inc
Liang Shi
,
Meta Inc

Abstract

This paper studies the design of cluster experiments to estimate the global treatment effect in the presence of network spillovers. We provide a framework to choose the clustering that minimizes the worst-case mean-squared error of the estimated global effect. We show that optimal clustering solves a novel penalized min-cut optimization problem computed via off-the-shelf semi-definite programming algorithms. Our analysis also characterizes simple conditions to choose between any two cluster designs, including choosing between a cluster or individual-level randomization. We illustrate the method’s properties using unique network data from the universe of Facebook’s users and existing data from a field experiment.

Regression Discontinuity Design with Spillovers

Eric Auerbach
,
Northwestern University
Yong Cai
,
University of Chicago
Ahnaf Al Rafi
,
Northwestern University

Abstract

Researchers who estimate treatment effects using a regression discontinuity design (RDD) typically assume that there are no spillovers between the treated and control units. This may be unrealistic. We characterize the estimand of RDD in a setting where spillovers occur between units that are close in their values of the running variable. Under the assumption that spillovers are linear-in-means, we show that the estimand depends on the ratio of two terms: (1) the radius over which spillovers occur and (2) the choice of bandwidth used for the local linear regression. Specifically, RDD estimates direct treatment effect when radius is of larger order than the bandwidth, and total treatment effect when radius is of smaller order than the bandwidth. In the more realistic regime where radius is of similar order as the bandwidth, the RDD estimand is a mix of the above effects. To recover direct and spillover effects, we propose incorporating estimated spillover terms into local linear regression – the local analog of peer effects regression. We also clarify the settings under which the donut-hole RD is able to eliminate the effects of spillovers.

A General Design-Based Framework and Estimator for Randomized Experiments

Christopher Harshaw
,
University of California-Berkeley and Massachusetts Institute of Technology
Fredrik Savje
,
Yale University
Yitan Wang
,
Yale University

Abstract

We describe a new design-based framework for drawing causal inference in randomized experiments. Causal effects in the framework are defined as linear functionals evaluated at potential outcome functions. Knowledge and assumptions about the potential outcome functions are encoded as function spaces. This makes the framework expressive, allowing experimenters to formulate and investigate a wide range of causal questions. We describe a class of estimators for estimands defined using the framework and investigate their properties. The construction of the estimators is based on the Riesz representation theorem. We provide necessary and sufficient conditions for unbiasedness and consistency. Finally, we provide conditions under which the estimators are asymptotically normal, and describe a conservative variance estimator to facilitate the construction of confidence intervals for the estimands.

Discussant(s)
Yong Cai
,
University of Chicago
fredrik savje
,
Yale University
Michael P. Leung
,
University of California-Santa Cruz
Peng Ding
,
University of California-Berkeley
Davide Viviano
,
Harvard University
JEL Classifications
  • C18 - Methodological Issues: General
  • C9 - Design of Experiments