Law of large numbers for a two-dimensional class cover problem

DOI10.1051/PS/2021013MaRDI QIDQ5030235zbMATH OpenOpenAlexFDO

Authors Elvan Ceyhan, John C. Wierman, Pengfei Xiang

Publication date 16 February 2022

Published in ESAIM: Probability and Statistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/ps/2021013

zbMATH Keywords

class cover catch digraphdomination numberlaw of large numberspattern classificationsubadditive process

Mathematics Subject Classification ID

Strong limit theorems (60F15) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• A general SLLN for the one-dimensional class cover problem
• A SLLN for a one-dimensional class cover problem
• scientific article; zbMATH DE number 2077689
• A CLT for a one-dimensional class cover problem
• The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data

Cites work

• A CLT for a one-dimensional class cover problem
• A general SLLN for the one-dimensional class cover problem
• A hierarchical methodology for class detection problems with skewed priors
• A matching problem and subadditive Euclidean functionals
• A new family of proximity graphs: class cover catch digraphs
• A SLLN for a one-dimensional class cover problem
• Approximation algorithms for the class cover problem
• Characterizing the scale dimension of a high-dimensional classification problem
• Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays
• Classification of imbalanced data with a geometric digraph family
• Classification using class cover catch digraphs
• Comparison of relative density of two random geometric digraph families in testing spatial clustering
• Ergodic theorems for superadditive processes.
• Extension of one-dimensional proximity regions to higher dimensions
• First-passage percolation on the square lattice
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 3231627 (Why is no real title available?)
• scientific article; zbMATH DE number 3290003 (Why is no real title available?)
• scientific article; zbMATH DE number 3085434 (Why is no real title available?)
• Learning pattern classification-a survey
• Limit theorems in discrete stochastic geometry
• Multiparameter subadditive processes
• Percolation in the secrecy graph
• Spatial clustering tests based on the domination number of a new random digraph family
• Subadditive ergodic theory
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• The algorithmic complexity of mixed domination in graphs
• The domination number of on-line social networks and random geometric graphs
• The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association
• Weak laws of large numbers in geometric probability

Cited in

(4)

• A CLT for a one-dimensional class cover problem
• A SLLN for a one-dimensional class cover problem
• scientific article; zbMATH DE number 2077689 (Why is no real title available?)
• A general SLLN for the one-dimensional class cover problem

This page was built for publication: Law of large numbers for a two-dimensional class cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030235)