Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association

DOI10.1016/j.csda.2005.03.002zbMath1445.62140arXiv0906.5436OpenAlexW2162238607MaRDI QIDQ959283

John C. Wierman, Elvan Ceyhan, Carey E. Priebe

Publication date: 11 December 2008

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

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

zbMATH Keywords

segregationassociationDelaunay triangulationrelative densityrandom proximity graphs

Mathematics Subject Classification ID

Directional data; spatial statistics (62H11) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items

Comparison of relative density of two random geometric digraph families in testing spatial clustering ⋮ A general SLLN for the one-dimensional class cover problem ⋮ Edge density of new graph types based on a random digraph family ⋮ Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family ⋮ The distribution of the relative arc density of a family of interval catch digraph based on uniform data ⋮ 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 ⋮ A CLT for a one-dimensional class cover problem ⋮ A classification of isomorphism-invariant random digraphs ⋮ Classification using proximity catch digraphs ⋮ A new family of random graphs for testing spatial segregation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the distribution of the domination number for random class cover catch digraphs
• Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays
• 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
• 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
• The Relation Between Pitman's Asymptotic Relative Efficiency of Two Tests and the Correlation Coefficient Between Their Test Statistics