arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0802.0615stat.MEmath.STstat.TH
收藏

一类新的检验空间分离性的随机图

A New Family of Random Graphs for Testing Spatial Segregation

E. Ceyhan, C. E. Priebe, D. J. Marchette

摘要:

我们讨论了一个基于图的方法来测试空间点模式。这种方法属于数据随机图的范畴,近年来已被引入并用于统计模式识别。我们的目标是测试完全的空间随机性对隔离和两个或两个以上的点类之间的关联。为了实现这一目标,我们使用一种特殊类型的参数化的随机有向图称为接近捕捉有向图(PCD),这是基于从各个类的数据点的相对位置。我们采用的统计量是PCD的相对密度。当适当缩放时,PCD的相对密度是$U$ -统计量。我们得到的渐近分布的相对密度,使用标准的中心极限理论的$U$ -统计。通过蒙特卡罗模拟评估检验统计量的有限样本性能,并通过Pitman的渐近有效性评估渐近性能,从而产生用于检验的最佳参数。此外,本文中讨论的方法也适用于多个维度的数据。

英文摘要:

We discuss a graph-based approach for testing spatial point patterns. This approach falls under the category of data-random graphs, which have been introduced and used for statistical pattern recognition in recent years. Our goal is to test complete spatial randomness against segregation and association between two or more classes of points. To attain this goal, we use a particular type of parametrized random digraph called proximity catch digraph (PCD) which is based based on relative positions of the data points from various classes. The statistic we employ is the relative density of the PCD. When scaled properly, the relative density of the PCD is a $U$-statistic. We derive the asymptotic distribution of the relative density, using the standard central limit theory of $U$-statistics. The finite sample performance of the test statistic is evaluated by Monte Carlo simulations, and the asymptotic performance is assessed via Pitman's asymptotic efficiency, thereby yielding the optimal parameters for testing. Furthermore, the methodology discussed in this article is also valid for data in multiple dimensions.

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

↑