Law Of Large Numbers For A Two-Dimensional Class Cover Problem

ESAIM-PROBABILITY AND STATISTICS(2021)

引用 0|浏览2
暂无评分
摘要
We prove a Law of Large Numbers (LLN) for the domination number of class cover catch digraphs (CCCD) generated by random points in two (or higher) dimensions. DeVinney and Wierman (2002) proved the Strong Law of Large Numbers (SLLN) for the uniform distribution in one dimension, and Wierman and Xiang (2008) extended the SLLN to the case of general distributions in one dimension. In this article, using subadditive processes, we prove a SLLN result for the domination number generated by Poisson points in Double-struck capital R-2. From this we obtain a Weak Law of Large Numbers (WLLN) for the domination number generated by random points in [0, 1](2) from uniform distribution first, and then extend these result to the case of bounded continuous distributions. We also extend the results to higher dimensions. The domination number of CCCDs and related digraphs have applications in statistical pattern classification and spatial data analysis.
更多
查看译文
关键词
Pattern classification, class cover catch digraph, domination number, law of large numbers, subadditive process
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要