arXiv 0802.06382008-02-05stat.MEmath.STstat.TH

The Use of Domination Number of a Random Proximity Catch Digraph for Testing Spatial Patterns of Segregation and Association

E. Ceyhan, C. E. Priebe

备注：: 13 pages, 7 figures
发表信息：: Statistics & Probability Letters (2005), 73, 37-50

英文摘要：

Priebe et al. (2001) introduced the class cover catch digraphs and computed the distribution of the domination number of such digraphs for one dimensional data. In higher dimensions these calculations are extremely difficult due to the geometry of the proximity regions; and only upper-bounds are available. In this article, we introduce a new type of data-random proximity map and the associated (di)graph in $\mathbb R^d$. We find the asymptotic distribution of the domination number and use it for testing spatial point patterns of segregation and association.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Relative Density of the Random $r$-Factor Proximity Catch Digraph for Testing Spatial Patterns of Segregation and Association

Statistical pattern classification methods based on data-random graphs were introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the data points from various classes. Different random graphs result from different definitions of the proximity region associated with each data point and different graph statistics can be employed for data reduction. The approach used in this article is based on a parameterized family of proximity maps determining an associated family of data-random digraphs. The relative arc density of the digr…

2008-02-05math.STstat.MEstat.TH

Domination Number of an Interval Catch Digraph Family and its use for Testing Uniformity

We consider a special type of interval catch digraph (ICD) family for one-dimensional data in a randomized setting and propose its use for testing uniformity. These ICDs are defined with an expansion and a centrality parameter, hence we will refer to this ICD as parameterized ICD (PICD). We derive the exact (and asymptotic) distribution of the domination number of this PICD family when its vertices are from a uniform (and non-uniform) distribution in one dimension for the entire range of the parameters; thereby determine the parameters for which the asymptotic distribution is non-degenerate. W…

2020-01-08stat.ME

Relative Density of the Random r-Factor Proximity Catch Digraph for Testing Spatial Patterns of Segregation and Association (Technical Report)

2009-06-30math.PRmath.STstat.ME

Spatial Clustering Tests Based on Domination Number of a New Random Digraph Family

We use the domination number of a parametrized random digraph family called proportional-edge proximity catch digraphs (PCDs) for testing multivariate spatial point patterns. This digraph family is based on relative positions of data points from various classes. We extend the results on the distribution of the domination number of proportional-edge PCDs, and use the domination number as a statistic for testing segregation and association against complete spatial randomness. We demonstrate that the domination number of the PCD has binomial distribution when size of one class is fixed while the …

2009-09-16math.PRmath.STstat.ME

A Comparison of Two Proximity Catch Digraph Families in Testing Spatial Clustering

We consider two parametrized random digraph families, namely, proportional-edge and central similarity proximity catch digraphs (PCDs) and compare the performance of these two PCD families in testing spatial point patterns. These PCD families are based on relative positions of data points from two classes and the relative density of the PCDs is used as a statistic for testing segregation and association against complete spatial randomness. When scaled properly, the relative density of a PCD is a U-statistic. We extend the distribution of the relative density of central similarity PCDs for expa…

2010-10-21math.COmath.PRstat.AP

Relative Edge Density of the Underlying Graphs Based on Proportional-Edge Proximity Catch Digraphs for Testing Bivariate Spatial Patterns (Technical Report)

The use of data-random graphs in statistical testing of spatial patterns is introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the points from various classes. Different random graphs result from different definitions of the proximity region associated with each data point and different graph statistics can be employed for pattern testing. The approach used in this article is based on underlying graphs of a family of data-random digraphs which is determined by a family of parameterized proximity maps. The relative edge de…

2009-06-30math.COmath.STstat.ME

更多相关论文收起更多论文

A New Family of Random Graphs for Testing Spatial Segregation

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…

2008-02-05math.STstat.MEstat.TH