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

DOI10.1080/03610921003597211zbMATH Open1220.62081arXiv0909.3034OpenAlexW2007097464MaRDI QIDQ82973FDOQ82973

Elvan Ceyhan, Elvan Ceyhan

Publication date: 22 March 2011

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

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.

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

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

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)

Cites Work

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

Cited In (8)

• 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
• 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
• pcds
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association

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)