Spatial clustering tests based on the domination number of a new random digraph family

DOI10.1080/03610921003597211MaRDI QIDQ82973zbMATH OpenOpenAlexFDO

Authors Elvan Ceyhan, Elvan Ceyhan

Publication date 22 March 2011

Published in Communications in Statistics: Theory and Methods (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0909.3034

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Directional data; spatial statistics (62H11) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Monte Carlo methods (65C05) Hypothesis testing in multivariate analysis (62H15) Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Inequalities; stochastic orderings (60E15)

Abstract: 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 size of the other (whose points constitute the vertices of the digraph) tends to infinity and asymptotic normality when sizes of both classes tend to infinity. We evaluate the finite sample performance of the test by Monte Carlo simulations, prove the consistency of the test under the alternatives, and suggest corrections for the support restriction on the class of points of interest and for small samples. We find the optimal parameters for testing each of the segregation and association alternatives. Furthermore, the methodology discussed in this article is valid for data in higher dimensions also.

Recommendations

• The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association
• On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
• Comparison of relative density of two random geometric digraph families in testing spatial clustering
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
• A new family of random graphs for testing spatial segregation

Cites work

• scientific article; zbMATH DE number 3934272 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1455125 (Why is no real title available?)
• scientific article; zbMATH DE number 1865517 (Why is no real title available?)
• A CLT for a one-dimensional class cover problem
• A SLLN for a one-dimensional class cover problem
• A general SLLN for the one-dimensional class cover problem
• A new family of proximity graphs: class cover catch digraphs
• A new family of random graphs for testing spatial segregation
• Characterizing the scale dimension of a high-dimensional classification problem
• Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays
• Classification using class cover catch digraphs
• Graph-theoretic measures of multivariate association and prediction
• Non‐ and semi‐parametric estimation of interaction in inhomogeneous point patterns
• On the distribution of the domination number for random class cover catch digraphs
• Overall and pairwise segregation tests based on nearest neighbor contingency tables
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
• Tests of Spatial Randomness Adjusted for an Inhomogeneity
• The Efficiency of Some Nonparametric Competitors of the $t$-Test
• The Relation Between Pitman's Asymptotic Relative Efficiency of Two Tests and the Correlation Coefficient Between Their Test Statistics
• The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
• The relative neighbourhood graph of a finite planar set
• The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association

Cited in

(9)

• Domination number of an interval catch digraph family and its use for testing uniformity
• Law of large numbers for a two-dimensional class cover problem
• The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association
• Comparison of relative density of two random geometric digraph families in testing spatial clustering
• pcds
• Extension of one-dimensional proximity regions to higher dimensions
• An investigation of new graph invariants related to the domination number of random proximity catch digraphs
• A new family of random graphs for testing spatial segregation
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association

Describes a project that uses

Uses Software

• spatial

This page was built for publication: Spatial clustering tests based on the domination number of a new random digraph family

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q82973)