arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.01470econ.EMstat.ME
收藏

网络推理机-鲁棒推理

Network Cluster-Robust Inference

Michael P. Leung

摘要:

由于网络数据通常由来自单个大型网络的观测数据组成,研究人员经常将网络划分为集群,以便应用集群鲁棒推理方法。现有的这种方法要求聚类是渐近独立的。在温和的条件下,我们证明,对于这个要求,以保持网络相关的数据,这是必要的和充分的集群具有低电导,边缘边界的大小与体积的比率。这就产生了一个简单的集群质量度量。我们发现,在模拟中,当集群具有低电导,集群鲁棒性的方法控制的大小比HAC估计。然而,对于缺乏低电导簇的重要网络类别,前者可以表现出相当大的尺寸失真。为了确定低电导集群的数量并构建它们,我们利用谱图理论中的结果,将电导连接到图拉普拉斯算子的谱。基于这些结果,我们提出了使用光谱来确定低电导团簇的数量和谱聚类来构建它们。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑