pcds

CRANpcdsMaRDI QIDQ82980FDOQ82980

Proximity Catch Digraphs and Their Applications

Elvan Ceyhan

Last update: 19 December 2023

Copyright license: GNU General Public License, version 2.0

Software version identifier: 0.1.5, 0.1.6, 0.1.0, 0.1.1, 0.1.2, 0.1.4, 0.1.7, 0.1.8

Description

Contains the functions for construction and visualization of various families of the proximity catch digraphs (PCDs), see (Ceyhan (2005) ISBN:978-3-639-19063-2), for computing the graph invariants for testing the patterns of segregation and association against complete spatial randomness (CSR) or uniformity in one, two and three dimensional cases. The package also has tools for generating points from these spatial patterns. The graph invariants used in testing spatial point data are the domination number (Ceyhan (2011) <doi:10.1080/03610921003597211>) and arc density (Ceyhan et al. (2006) <doi:10.1016/j.csda.2005.03.002>; Ceyhan et al. (2007) <doi:10.1002/cjs.5550350106>). The PCD families considered are Arc-Slice PCDs, Proportional-Edge PCDs, and Central Similarity PCDs.

Cites work

• 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
• A new family of random graphs for testing spatial segregation

Cited In (2)

• pcds.ugraph
• nnspat

This page was built for software: pcds