×

Comparison of relative density of two random geometric digraph families in testing spatial clustering. (English) Zbl 1297.62199

Summary: We compare the performance of relative densities of two parameterized random geometric digraph families called proximity catch digraphs (PCDs) in testing bivariate spatial patterns. These PCD families are proportional edge (PE) and central similarity (CS) PCDs and are defined with proximity regions based on relative positions of data points from two classes. The relative densities of these PCDs were previously used as statistics for testing segregation and association patterns against complete spatial randomness. The relative density of a digraph, \(D\), with \(n\) vertices (i.e., with order \(n\)) represents the ratio of the number of arcs in \(D\) to the number of arcs in the complete symmetric digraph of the same order. When scaled properly, the relative density of a PCD is a \(U\)-statistic; hence, it has asymptotic normality by the standard central limit theory of \(U\)-statistics. The PE- and CS-PCDs are defined with an expansion parameter that determines the size or measure of the associated proximity regions. In this article, we extend the distribution of the relative density of CS-PCDs for expansion parameter being larger than one, and compare finite sample performance of the tests by Monte Carlo simulations and asymptotic performance by Pitman asymptotic efficiency. We find the optimal expansion parameters of the PCDs for testing each alternative in finite samples and in the limit as the sample size tending to infinity. As a result of our comparisons, we demonstrate that in terms of empirical power (i.e., for finite samples) relative density of CS-PCD has better performance (which occurs for expansion parameter values larger than one) for the segregation alternative, while relative density of PE-PCD has better performance for the association alternative. The methods are also illustrated in a real-life data set from plant ecology.

MSC:

62M30 Inference from spatial processes
60D05 Geometric probability and stochastic geometry
05C80 Random graphs (graph-theoretic aspects)
05C20 Directed graphs (digraphs), tournaments
62G10 Nonparametric hypothesis testing

Software:

spatstat
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Baddeley AJ, Turner R (2005) Spatstat: an R package for analyzing spatial point patterns. J Stat Softw 12(6):1–42
[2] Beer E, Fill JA, Janson S, Scheinerman ER (2010) On vertex, edge, and vertex-edge random graphs. arXiv:0812.1410v2 [math.CO] · Zbl 1217.05205
[3] Ceyhan E (2010a) A comparison of two proximity catch digraph families in testing spatial clustering. Technical Report # KU-EC-10-3, Koç University, Istanbul, Turkey. arXiv:1010.4436v1 [math.CO]
[4] Ceyhan E (2010b) Extension of one-dimensional proximity regions to higher dimensions. Comput Geom Theor Appl 43(9):721–748 · Zbl 1229.65046 · doi:10.1016/j.comgeo.2010.05.002
[5] Ceyhan E (2010c) New tests of spatial segregation based on nearest neighbor contingency tables. Scand J Stat 37:147–165 · Zbl 1223.62094 · doi:10.1111/j.1467-9469.2009.00667.x
[6] Ceyhan E (2011) Spatial clustering tests based on domination number of a new random digraph family. Commun Stat, Theory Methods 40(8):1363–1395 · Zbl 1220.62081 · doi:10.1080/03610921003597211
[7] Ceyhan E, Priebe CE, Wierman JC (2006) Relative density of the random r-factor proximity catch digraphs for testing spatial patterns of segregation and association. Comput Stat Data Anal 50(8):1925–1964 · Zbl 1445.62140 · doi:10.1016/j.csda.2005.03.002
[8] Ceyhan E, Priebe CE, Marchette DJ (2007) A new family of random graphs for testing spatial segregation. Can J Stat 35(1):27–50 · Zbl 1124.05039 · doi:10.1002/cjs.5550350106
[9] Coleman TF, Moré JJ (1983) Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J Numer Anal 20(1):187–209 · Zbl 0527.65033 · doi:10.1137/0720013
[10] Coomes DA, Rees M, Turnbull L (1999) Identifying aggregation and association in fully mapped spatial data. Ecology 80(2):554–565 · doi:10.1890/0012-9658(1999)080[0554:IAAAIF]2.0.CO;2
[11] Cressie NAC (1993) Statistics for spatial data. Wiley, New York
[12] DeVinney J, Priebe CE, Marchette DJ, Socolinsky D (2002) Random walks and catch digraphs in classification. In: Proceedings of the 34th symposium on the interface: computing science and statistics, vol 34. http://www.galaxy.gmu.edu/interface/I02/I2002Proceedings/DeVinneyJason/DeVinneyJason.paper.pdf
[13] Diggle PJ (2003) Statistical analysis of spatial point patterns. Hodder Arnold Publishers, London · Zbl 1021.62076
[14] Dixon PM (1994) Testing spatial segregation using a nearest-neighbor contingency table. Ecology 75(7):1940–1948 · doi:10.2307/1941598
[15] Dixon PM (2002a) Nearest-neighbor contingency table analysis of spatial segregation for several species. Ecoscience 9(2):142–151
[16] Dixon PM (2002b) Nearest neighbor methods. In: El-Shaarawi AH, Piegorsch WW (eds) Encyclopedia of environmetrics, vol 3. Wiley, New York, pp 1370–1383
[17] Erdos P, Rényi A (1959) On random graphs I. Publ Math (Debr) 6:290–297 · Zbl 0092.15705
[18] Fall A, Fortin MJ, Manseau M, O’Brien D (2007) Ecosystems. Int J Geogr Inf Sci 10(3):448–461
[19] Faragó A (2008) A general tractable density concept for graphs. Math Comput Sci 1(4):689–699 · Zbl 1144.05063 · doi:10.1007/s11786-007-0026-2
[20] Goldberg AV (1984) Finding a maximum density subgraph. Technical Report UCB/CSD-84-171, EECS Department, University of California, Berkeley
[21] Good BJ, Whipple SA (1982) Tree spatial patterns: South Carolina bottomland and swamp forests. Bull Torrey Bot Club 109:529–536 · doi:10.2307/2996494
[22] Illian J, Burslem D (2007) Contributions of spatial point process modelling to biodiversity theory. Coexistence 148(148):9–29
[23] Janson S, Łuczak T, Ruciński A (2000) Random graphs. Wiley-Interscience series in discrete mathematics and optimization. Wiley, New York · Zbl 0968.05003
[24] Jaromczyk JW, Toussaint GT (1992) Relative neighborhood graphs and their relatives. Proc IEEE 80:1502–1517 · doi:10.1109/5.163414
[25] Jung I, Kulldorff M (2007) Theoretical properties of tests for spatial clustering of count data. Can J Stat 35(3):433–446 · Zbl 1132.62039 · doi:10.1002/cjs.5550350307
[26] Keitt T (2007) Introduction to spatial modeling with networks. Presented at the workshop on networks in ecology and beyond organized by the PRIMES (program in interdisciplinary math, ecology and statistics) at Colorado State University, Fort Collins, Colorado
[27] Kendall M, Stuart A (1979) The advanced theory of statistics, vol 2, 4th edn. Griffin, London · Zbl 0416.62001
[28] Lehmann EL (1988) Nonparametrics: statistical methods based on ranks. Prentice-Hall, Upper Saddle River
[29] Leibovich E (2009) Approximating graph density problems. PhD thesis, The Open University of Israel, Department of Mathematics and Computer Science
[30] Marchette DJ, Priebe CE (2003) Characterizing the scale dimension of a high dimensional classification problem. Pattern Recognit 36(1):45–60 · Zbl 1027.68690 · doi:10.1016/S0031-3203(02)00042-0
[31] Minor ES, Urban DL (2007) Graph theory as a proxy for spatially explicit population models in conservation planning. Ecol Appl 17(6):1771–1782 · doi:10.1890/06-1073.1
[32] Okabe A, Boots B, Sugihara K, Chiu SN (2000) Spatial tessellations: concepts and applications of Voronoi diagrams. Wiley, New York · Zbl 0946.68144
[33] Penrose M (2003) Random geometric graphs. Number 5 in Oxford studies in probability. Oxford University Press, London
[34] Priebe CE, DeVinney JG, Marchette DJ (2001) On the distribution of the domination number of random class cover catch digraphs. Stat Probab Lett 55:239–246 · Zbl 0999.05082 · doi:10.1016/S0167-7152(01)00129-8
[35] Priebe CE, Marchette DJ, DeVinney J, Socolinsky D (2003) Classification using class cover catch digraphs. J Classif 20(1):3–23 · Zbl 1055.62074 · doi:10.1007/s00357-003-0003-7
[36] Roberts SA, Hall GB, Calamai PH (2000) Analysing forest fragmentation using spatial autocorrelation, graphs and GIS. Int J Geogr Inf Sci 14(2):185–204 · Zbl 05419700 · doi:10.1080/136588100240912
[37] Shenggui Z, Hao S, Xueliang L (2002) w-density and w-balanced property of weighted graphs. Appl Math J Chin Univ 17(3):355–364 · Zbl 1016.05067 · doi:10.1007/s11766-002-0015-9
[38] Toussaint GT (1980) The relative neighborhood graph of a finite planar set. Pattern Recognit 12(4):261–268 · Zbl 0437.05050 · doi:10.1016/0031-3203(80)90066-7
[39] van Eeden C (1963) The relation between Pitman’s asymptotic relative efficiency of two tests and the correlation coefficient between their test statistics. Ann Math Stat 34(4):1442–1451 · Zbl 0128.38505 · doi:10.1214/aoms/1177703876
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.