A new family of random graphs for testing spatial segregation

DOI10.1002/cjs.5550350106zbMath1124.05039arXiv0802.0615OpenAlexW2142623187MaRDI QIDQ5421209

Elvan Ceyhan, Carey E. Priebe, David J. Marchette

Publication date: 22 October 2007

Published in: Canadian Journal of Statistics (Search for Journal in Brave)

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

zbMATH Keywords

segregationassociationrandom graphDelaunay triangulationcomplete spatial randomnessrelative densityproximity catch digraph

Mathematics Subject Classification ID

Inference from spatial processes (62M30) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

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 ⋮ Prototype selection for interpretable classification ⋮ Classification using proximity catch digraphs

Uses Software

• spatial

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
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
• 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 Relation Between Pitman's Asymptotic Relative Efficiency of Two Tests and the Correlation Coefficient Between Their Test Statistics

This page was built for publication: A new family of random graphs for testing spatial segregation