A CLT for a one-dimensional class cover problem

DOI10.1016/j.spl.2008.07.045zbMath1157.60017OpenAlexW4252981270MaRDI QIDQ1003427

John C. Wierman, Pengfei Xiang

Publication date: 4 March 2009

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2008.07.045

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05)

Related Items (4)

Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family ⋮ An investigation of new graph invariants related to the domination number of random proximity catch digraphs ⋮ Domination number of an interval catch digraph family and its use for testing uniformity ⋮ Law of large numbers for a two-dimensional class cover problem

Cites Work

• On the distribution of the domination number for random class cover catch digraphs
• A hierarchical methodology for class detection problems with skewed priors
• A general SLLN for the one-dimensional class cover problem
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
• Approximation algorithms for the class cover problem
• Classification using class cover catch digraphs
• Negative association of random variables, with applications
• Characterizing the scale dimension of a high-dimensional classification problem
• A SLLN for a one-dimensional class cover problem
• A new family of proximity graphs: class cover catch digraphs
• The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association
• A strong law of large numbers for arrays of rowwise negatively dependent random variables
• A new family of random graphs for testing spatial segregation
• On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs

This page was built for publication: A CLT for a one-dimensional class cover problem