Domination number of an interval catch digraph family and its use for testing uniformity
From MaRDI portal
Publication:5222209
Abstract: We consider a special type of interval catch digraph (ICD) family for one-dimensional data in a randomized setting and propose its use for testing uniformity. These ICDs are defined with an expansion and a centrality parameter, hence we will refer to this ICD as parameterized ICD (PICD). We derive the exact (and asymptotic) distribution of the domination number of this PICD family when its vertices are from a uniform (and non-uniform) distribution in one dimension for the entire range of the parameters; thereby determine the parameters for which the asymptotic distribution is non-degenerate. We observe jumps (from degeneracy to non-degeneracy or from a non-degenerate distribution to another) in the asymptotic distribution of the domination number at certain parameter combinations. We use the domination number for testing uniformity of data in real line, prove its consistency against certain alternatives, and compare it with two commonly used tests and three recently proposed tests in literature and also arc density of this ICD and of another ICD family in terms of size and power. Based on our extensive Monte Carlo simulations, we demonstrate that domination number of our PICD has higher power for certain types of deviations from uniformity compared to other tests.
Recommendations
- Density of a random interval catch digraph family and its use for testing uniformity
- Spatial clustering tests based on the domination number of a new random digraph family
- On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
- The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association
- 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 1270237 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- A CLT for a one-dimensional class cover problem
- A characterization of interval catch digraphs
- A digraph represented by a family of boxes or spheres
- A new family of proximity graphs: class cover catch digraphs
- Algorithms for interval catch digraphs
- Approximation algorithms for the class cover problem
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Circular‐arc digraphs: A characterization
- Classification of imbalanced data with a geometric digraph family
- Classification using class cover catch digraphs
- Density of a random interval catch digraph family and its use for testing uniformity
- Domination in a digraph and in its reverse
- Entropy-based goodness-of-fit test for exponentiality
- Forbidden substructure for interval digraphs/bigraphs
- On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
- On the distribution of the domination number for random class cover catch digraphs
- On the out-domination and in-domination numbers of a digraph
- On vertex, edge, and vertex-edge random graphs
- Random Graphs for Statistical Pattern Recognition
- Testing uniformity based on new entropy estimators
- The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data
- The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association
- Topological Classification of RNA Structures via Intersection Graph
- Total domination in digraphs
- Total domination in graphs
- Uniquely restricted matchings in interval graphs
Cited in
(4)- Density of a random interval catch digraph family and its use for testing uniformity
- On some subclasses of interval catch digraphs
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data
- The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
This page was built for publication: Domination number of an interval catch digraph family and its use for testing uniformity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222209)