arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.03712stat.ME
收藏

局部相依观测值的图一致性度量

Measuring the Graph Concordance of Locally Dependent Observations

Kyungchul Song

摘要:

本文介绍了一种简单的测量方法,测量网络中观察到的结果之间的一致性模式,即,相邻结果往往比非相邻结果更强相关的模式。图一致性测度一般可用于量化网络在解释结果的横截面依赖性方面的经验相关性,如本文所示,也可用于量化在一定条件下的同质性程度。当我们观察一个大的网络时,对和谐模式进行推断是很重要的。在依赖图的假设下,提出了一种基于置换的图一致性置信区间。当结果可交换时,该置信区间在有限样本下是有效的,在依赖图假设和其他正则条件下,该置信区间表现出渐近有效性.蒙特卡罗模拟结果表明,置换方法的有效性是更强大的各种图形配置比渐近方法。

英文摘要:

This paper introduces a simple measure of a concordance pattern among observed outcomes along a network, i.e., the pattern in which adjacent outcomes tend to be more strongly correlated than non-adjacent outcomes. The graph concordance measure can be generally used to quantify the empirical relevance of a network in explaining cross-sectional dependence of the outcomes, and as shown in the paper, can also be used to quantify the extent of homophily under certain conditions. When one observes a single large network, it is nontrivial to make inference about the concordance pattern. Assuming dependency graph, this paper develops a permutation-based confidence interval for the graph concordance measure. The confidence interval is valid in finite samples when the outcomes are exchangeable, and under the dependency graph assumption together with other regularity conditions, is shown to exhibit asymptotic validity. Monte Carlo simulation results show that the validity of the permutation method is more robust to various graph configurations than the asymptotic method.

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

↑