×

A new family of random graphs for testing spatial segregation. (English) Zbl 1124.05039

Summary: 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 which is based on relative positions of the data points from various classes. The statistic employed is the relative density of the proximity catch digraph, 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

MSC:

05C20 Directed graphs (digraphs), tournaments
05C80 Random graphs (graph-theoretic aspects)
62M30 Inference from spatial processes

Software:

spatial
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] E. Ceyhan & C. E. Priebe (2003). Central similarity proximity maps in Delaunay tessellations. In ASA Proceedings of the Joint Statistical Meetings, 840â845.
[2] Ceyhan, The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association, Statistics & Probability Letters 73 pp 37– (2005) · Zbl 1080.62031
[3] E. Ceyhan, C. E. Priebe & D. J. Marchette (2004). Relative density of random Ï-factor proximity catch digraph for testing spatial patterns of segregation and association. Technical Report 645, Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, Maryland 21218, USA.
[4] Ceyhan, Relative density of the random Ï-factor proximity catch digraphs for testing spatial patterns of segregation and association, Computational Statistics and Data Analysis 50 pp 1925– (2006) · Zbl 1445.62140
[5] Coomes, Identifying aggregation and association in fully mapped spatial data, Ecology 80 pp 554– (1999)
[6] Cressie, Statistics for Spatial Data. (1991) · Zbl 0799.62002
[7] DeVinney, Computing Science and Statistics, Volume 34: Montréal, Québec (2002)
[8] Diggle, Statistical Analysis of Spatial Point Patterns. (1983) · Zbl 0559.62088
[9] Dixon, Testing spatial segregation using a nearest-neighbour contingency table, Ecology 75 pp 1940– (1994)
[10] Dixon, Nearest-neighbour contingency table analysis of spatial segregation for several species, Ecoscience 9 pp 142– (2002)
[11] Gotelli, Null Models in Ecology. (1996)
[12] Hamill, Testing the dispersion of juveniles relative to adults: A new analytical method, Ecology 67 pp 952– (1986)
[13] Janson, Random Graphs. (2000)
[14] Jaromczyk, Relative neighbourhood graphs and their relatives, Proceedings of IEEE 80 pp 1502– (1992)
[15] Kendall, The Advanced Theory of Statistics 2 (1979) · Zbl 0416.62001
[16] Lahiri, On consistency of estimators based on spatial data under infill asymptotics, Sankhya: The Indian Journal of Statistics, Series A 58 pp 403– (1996) · Zbl 0885.62112
[17] Lehmann, Nonparametrics: Statistical Methods Based on Ranks. (1988) · Zbl 0354.62038
[18] Marchette, Characterizing the scale dimension of a high dimensional classification problem, Pattern Recognition 36 pp 45– (2003) · Zbl 1027.68690
[19] Nanami, Dioecy-induced spatial patterns of two codominant tree species, podocarpus nagi and neolitsea aciculata, Journal of Ecology 87 pp 678– (1999)
[20] Okabe, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. (2000) · Zbl 0946.68144
[21] Pielou, Segregation and symmetry in two-species populations as studied by nearest-neighbour relationships, Journal of Ecology 49 pp 255– (1961)
[22] Priebe, On the distribution of the domination number of random class catch cover digraphs, Statistics & Probability Letters 55 pp 239– (2001) · Zbl 0999.05082
[23] Priebe, Classification using class cover catch digraphs, Journal of Classification 20 pp 3– (2003) · Zbl 1055.62074
[24] Priebe, Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays, Computational Statistics and Data Analysis on Visualization 43 pp 621– (2003) · Zbl 1429.62594
[25] Ripley, Spatial Statistics. (1981)
[26] Toussaint, The relative neighbourhood graph of a finite planar set, Pattern Recognition 12 pp 261– (1980) · Zbl 0437.05050
[27] van Eeden, The relation between Pitman’s asymptotic relative efficiency of two tests and the correlation coefficient between their test statistics, The Annals of Mathematical Statistics 34 pp 1442– (1963) · Zbl 0128.38505
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.