Relative Density of the Random r-Factor Proximity Catch Digraph for Testing Spatial Patterns of Segregation and Association (Technical Report)
Elvan Ceyhan, Carey E. Priebe, John C. Wierman

TL;DR
This paper introduces a new statistical method using relative arc density of data-random digraphs for testing spatial patterns, offering analytical tractability and applicability in any dimension.
Contribution
It proposes a parameterized family of proximity maps and uses relative arc density as a novel summary statistic for spatial pattern testing.
Findings
Relative arc density is a U-statistic after re-scaling.
Method allows asymptotic distribution analysis using U-statistic theory.
Application demonstrates effectiveness in testing segregation and association patterns.
Abstract
Statistical pattern classification methods based on data-random graphs were introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the data points from various classes. Different random graphs result from different definitions of the proximity region associated with each data point and different graph statistics can be employed for data reduction. The approach used in this article is based on a parameterized family of proximity maps determining an associated family of data-random digraphs. The relative arc density of the digraph is used as the summary statistic, providing an alternative to the domination number employed previously. An important advantage of the relative arc density is that, properly re-scaled, it is a U-statistic, facilitating analytic study of its asymptotic distribution using standard U-statistic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoil Geostatistics and Mapping · Computational Geometry and Mesh Generation · Data Management and Algorithms
