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.5436MaRDI QIDQ959283

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

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

segregation; association; Delaunay triangulation; relative density; random proximity graphs

Mathematics Subject Classification ID

62H11: Directional data; spatial statistics

62H30: Classification and discrimination; cluster analysis (statistical aspects)

05C80: Random graphs (graph-theoretic aspects)

05C20: Directed graphs (digraphs), tournaments

Related Items

A new family of random graphs for testing spatial segregation, A general SLLN for the one-dimensional class cover problem, Extension of one-dimensional proximity regions to higher dimensions, A CLT for a one-dimensional class cover problem

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