The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data

DOI10.1016/J.DISC.2007.10.003MaRDI QIDQ998418zbMATH OpenOpenAlexFDO

Authors Elvan Ceyhan

Publication date 28 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0810.1893

zbMATH Keywords

domination numberproximity mapnon-uniform distributionclass cover catch digraphrandom digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: For two or more classes of points in $R^d$ with $dge1$, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect to the points from the other class. The CCCDs were introduced by (Priebe, DeVinney, and Mar-chette, (2001). On the distribution of the domination number of random class catch cover di-graphs. Statistics and Probability Letters, 55:239-246) who investigated the case of two classes, $X$ and $Y$. They calculated the exact (finite sample) distribution of the domination number of the CCCDs based on $X$ points relative to $Y$ points both of which were uniformly distri-buted on a bounded interval. We investigate the distribution of the domination number of the CCCDs based on data from non-uniform $X$ points on an interval with end points from $Y$. Then we extend these calculations for multiple $Y$ points on bounded intervals.

Recommendations

• On the distribution of the domination number for random class cover catch digraphs
• scientific article; zbMATH DE number 2077689
• On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
• Domination number of an interval catch digraph family and its use for testing uniformity
• An investigation of new graph invariants related to the domination number of random proximity catch digraphs
• On the domination number of a random graph
• On the concentration of the domination number of the random graph
• Density of a random interval catch digraph family and its use for testing uniformity
• The distribution of the relative arc density of a family of interval catch digraph based on uniform data

Cites work

• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A SLLN for a one-dimensional class cover problem
• Algorithms for interval catch digraphs
• 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 using class cover catch digraphs
• Inequalities for minimal covering sets in set systems of given rank
• Interval digraphs: An analogue of interval graphs
• On the distribution of the domination number for random class cover catch digraphs
• The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
• The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association

Cited in

(11)

• Spatial clustering tests based on the domination number of a new random digraph family
• 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
• The distribution of the relative arc density of a family of interval catch digraph based on uniform data
• A new family of proximity graphs: class cover catch digraphs
• Extension of one-dimensional proximity regions to higher dimensions
• An investigation of new graph invariants related to the domination number of random proximity catch digraphs
• On the distribution of the domination number for random class cover catch digraphs
• A general SLLN for the one-dimensional class cover problem
• 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

This page was built for publication: The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data

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