Comparison of relative density of two random geometric digraph families in testing spatial clustering

DOI10.1007/S11749-013-0344-4zbMATH Open1297.62199arXiv1010.4436OpenAlexW2091815663WikidataQ87578487 ScholiaQ87578487MaRDI QIDQ464444FDOQ464444

Authors: Elvan Ceyhan 

Publication date: 17 October 2014

Published in: Test (Search for Journal in Brave)

Abstract: We consider two parametrized random digraph families, namely, proportional-edge and central similarity proximity catch digraphs (PCDs) and compare the performance of these two PCD families in testing spatial point patterns. These PCD families are based on relative positions of data points from two classes and the relative density of the PCDs is used as a statistic for testing segregation and association against complete spatial randomness. When scaled properly, the relative density of a PCD is a U-statistic. We extend the distribution of the relative density of central similarity PCDs for expansion parameter being larger than one. We compare the asymptotic distribution of the statistic for the two PCD families, using the standard central limit theory of U-statistics. We compare finite sample performance of the tests by Monte Carlo simulations and prove the consistency of the tests under the alternatives. The asymptotic performance of the tests under the alternatives is assessed by Pitman's asymptotic efficiency. We find the optimal expansion parameters of the PCDs for testing each of the segregation and association alternatives in finite samples and in the limit. We demonstrate that in terms of empirical power (i.e., for finite samples) relative density of central similarity PCD has better performance (which occurs for expansion parameter values larger than one) under segregation alternative, while relative density of proportional-edge PCD has better performance under association alternative. The methods are illustrated in a real-life example from plant ecology.

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

Recommendations

• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
• 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
• Edge density of new graph types based on a random digraph family
• A new family of random graphs for testing spatial segregation

zbMATH Keywords

segregationassociationcomplete spatial randomness\(U\)-statisticDelaunay triangulationPitman asymptotic efficiencyproximity catch digraphs

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Inference from spatial processes (62M30) Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05)

Cites Work

• Title not available (Why is that?)
• 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
• New tests of spatial segregation based on nearest neighbour contingency tables
• 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
• Spatial clustering tests based on the domination number of a new random digraph family
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
• Title not available (Why is that?)
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Theoretical properties of tests for spatial clustering of count data
• \(w\)-density and \(w\)-balanced property of weighted graphs
• On vertex, edge, and vertex-edge random graphs
• A general tractable density concept for graphs
• Extension of one-dimensional proximity regions to higher dimensions

Cited In (7)

• Spatial clustering tests based on the domination number of a new random digraph family
• Law of large numbers for a two-dimensional class cover problem
• A classification of isomorphism-invariant random digraphs
• Density of a random interval catch digraph family and its use for testing uniformity
• Edge density of new graph types based on a random digraph family
• A new family of random graphs for testing spatial segregation
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association

Uses Software

• spatstat

This page was built for publication: Comparison of relative density of two random geometric digraph families in testing spatial clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464444)