A SLLN for a one-dimensional class cover problem

Jason DeVinney and John C. Wierman

Statistics & Probability Letters, 2002, vol. 59, issue 4, 425-435

Abstract: Class cover catch digraphs arise in classification problems in statistical pattern recognition. We prove a strong law of large numbers for the domination number in a random one-dimensional model of class cover catch digraphs. The proof avoids complicated computations due to the dependence of random variables by considering a related Poisson process problem where we may apply classical strong law results and Chernoff exponential probability bounds. Complete convergence in the Poisson representation establishes the desired result for the original problem.

Keywords: Class; cover; problem; Catch; digraphs; Domination; Poisson; process; Complete; convergence; Strong; law; of; large; numbers; Classification; Pattern; recognition (search for similar items in EconPapers)
Date: 2002
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(02)00243-2
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:59:y:2002:i:4:p:425-435

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().