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

DOI10.1080/03610921003597211zbMath1220.62081arXiv0909.3034OpenAlexW2007097464MaRDI QIDQ82973

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

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

Related Items

Comparison of relative density of two random geometric digraph families in testing spatial clustering, pcds, An investigation of new graph invariants related to the domination number of random proximity catch digraphs, Extension of one-dimensional proximity regions to higher dimensions, Law of large numbers for a two-dimensional class cover problem

Uses Software

• spatial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the distribution of the domination number for random class cover catch digraphs
• 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
• A CLT for a one-dimensional class cover problem
• The relative neighbourhood graph of a finite planar set
• 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
• Non‐ and semi‐parametric estimation of interaction in inhomogeneous point patterns
• 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