no code implementations • 13 Mar 2024 • Michael P. Leung
In settings with interference, researchers commonly define estimands using exposure mappings to summarize neighborhood variation in treatment assignments.
no code implementations • 15 Nov 2022 • Michael P. Leung, Pantelis Loupos
This paper studies causal inference with observational network data.
no code implementations • 2 Mar 2021 • Michael P. Leung
Since network data commonly consists of observations from a single large network, researchers often partition the network into clusters in order to apply cluster-robust inference methods.
no code implementations • 6 Feb 2020 • Michael P. Leung
We develop inference procedures robust to general forms of weak dependence.
1 code implementation • 16 Jan 2020 • Hossein Alidaee, Eric Auerbach, Michael P. Leung
Breza et al. (2017) propose aggregated relational data (ARD) as a low-cost substitute that can be used to recover the structure of a latent social network when it is generated by a specific parametric random effects model.
no code implementations • 16 Nov 2019 • Michael P. Leung
Under a finite population model, we show that the estimator is biased but that the bias can be interpreted as the variance of unit-level exposure effects.
no code implementations • 24 Apr 2019 • Michael P. Leung, Hyungsik Roger Moon
We prove a central limit theorem for network moments in a model of network formation with strategic interactions and homophilous agents.