Publication:
A new family of random graphs for testing spatial segregation

Placeholder

Departments

School / College / Institute

Program

KU-Authors

KU Authors

Co-Authors

Priebe, Carey E.
Marchette, David J.

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

The authors discuss a graph-based approach for testing spatial point patterns. This approach falls under the category of data-random graphs, which have been introduced and used for statistical pattern recognition in recent years. The authors address specifically the problem of testing. complete spatial randomness against spatial patterns of segregation or association between two or more classes of points on the plane. To this end, they use a particular type of parameterized random digraph called a proximity catch digraph (PCD) which is based on relative positions of the data points from various classes. The statistic employed is the relative density of the PCD, which is a U-statistic when scaled properly. The authors derive the limiting distribution of the relative, density, using the standard asymptotic theory of U-statistics. They evaluate the finite-sample performance of their test statistic by Monte Carlo simulations and assess its asymptotic performance via Pitman's asymptotic efficiency, thereby yielding the optimal parameters for testing. They further stress that their methodology remains valid for data in higher dimensions.

Source

Publisher

Wiley

Subject

Statistics, Probability

Citation

Has Part

Source

Canadian Journal of Statistics / Revue canadienne de statistique

Book Series Title

Edition

DOI

10.1002/cjs.5550350106

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details