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. Existing such methods require clusters to be asymptotically independent. Under mild conditions, we prove that, for this requirement to hold for network-dependent data, it is necessary and sufficient that clusters have low conductance, the ratio of edge boundary size to volume. This yields a simple measure of cluster quality. We find in simulations that when clusters have low conductance, cluster-robust methods control size better than HAC estimators. However, for important classes of networks lacking low-conductance clusters, the former can exhibit substantial size distortion. To determine the number of low-conductance clusters and construct them, we draw on results in spectral graph theory that connect conductance to the spectrum of the graph Laplacian. Based on these results, we propose to use the spectrum to determine the number of low-conductance clusters and spectral clustering to construct them.
Robust Inference in High Dimensional Linear Model with Cluster Dependence
聚类标准误(Liang and Zeger,1986)被实证研究者广泛用于解释线性模型中的聚类依赖性。众所周知,这个标准误差是有偏差的。我们通过重新审视Chesher和Jewitt(1987)的方法,证明了在高维渐近性下偏差不会消失。在Cattaneo,Jansson和Newey(2018)引入的高维设置下,提供了一种对聚类依赖性无偏,一致和鲁棒的替代leave-cluster-out crossfit(LCOC)估计量。由于LCOC估计嵌套了Kline,Saggio和Solvsten(2019)的留一交叉拟合估计,因此这两篇论文是统一的。蒙特卡罗比较提供其有限样本性质的见解。然后,LCOC估计量被应用于Angrist和Lavy(2009)关于高中成就奖影响的研究以及Donohue III和Levitt(2001)关于堕胎对犯罪影响的研究。
Cluster-robust inference with a single treated cluster using the t-test
Kenneth C. Griffin Department of Economics, The University of Chicago(芝加哥大学肯尼斯·C·格里芬经济学系);Department of Statistics, The University of Chicago(芝加哥大学统计系)
本文针对单一处理簇与固定数量控制簇的推断问题,提出基于 t 统计量且无需方差估计的聚类稳健检验方法,并给出临界值计算方案与常用临界值表,适用于双重差分等实证研究。