Domination number of an interval catch digraph family and its use for testing uniformity
DOI10.1080/02331888.2020.1720020zbMATH Open1435.05178arXiv2001.03013OpenAlexW3003968061MaRDI QIDQ5222209FDOQ5222209
Authors: Elvan Ceyhan
Publication date: 1 April 2020
Published in: Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.03013
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
Asymptotic distribution theory in statistics (62E20) Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05)
Cites Work
- Random Graphs for Statistical Pattern Recognition
- A CLT for a one-dimensional class cover problem
- On the distribution of the domination number for random class cover catch digraphs
- Classification using class cover catch digraphs
- A new family of proximity graphs: class cover catch digraphs
- The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association
- The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
- A characterization of interval catch digraphs
- Algorithms for interval catch digraphs
- Approximation algorithms for the class cover problem
- Classification of imbalanced data with a geometric digraph family
- Title not available (Why is that?)
- Total domination in graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- A digraph represented by a family of boxes or spheres
- Title not available (Why is that?)
- On the out-domination and in-domination numbers of a digraph
- Domination in a digraph and in its reverse
- On vertex, edge, and vertex-edge random graphs
- Circular‐arc digraphs: A characterization
- Title not available (Why is that?)
- On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data
- Forbidden substructure for interval digraphs/bigraphs
- Uniquely Restricted Matchings in Interval Graphs
- Entropy-based goodness-of-fit test for exponentiality
- Total domination in digraphs
- Testing uniformity based on new entropy estimators
- Topological Classification of RNA Structures via Intersection Graph
Cited In (3)
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)