pcds.ugraph
Underlying Graphs of Proximity Catch Digraphs and Their Applications
Contains the functions for construction and visualization of underlying and reflexivity graphs of the three families of the proximity catch digraphs (PCDs), see (Ceyhan (2005) ISBN:978-3-639-19063-2), and for computing the edge density of these PCD-based graphs which are then used for testing the patterns of segregation and association against complete spatial randomness (CSR) or uniformity in one and two dimensional cases. The PCD families considered are Arc-Slice PCDs, Proportional-Edge (PE) PCDs doi:10.1016/j.csda.2005.03.002 and Central Similarity PCDs doi:10.1002/cjs.5550350106. See also doi:10.1016/j.stamet.2016.07.003 for edge density of the underlying and reflexivity graphs of PE-PCDs. The package also has tools for visualization of PCD-based graphs for one, two, and three dimensional data.
- Version0.1.1
- R versionunknown
- LicenseGPL-2
- Needs compilation?No
- Languageen-US
- Last release12/19/2023
Documentation
Team
Elvan Ceyhan
Insights
Last 30 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports3 packages
- Suggests5 packages