Domination number of an interval catch digraph family and its use for testing uniformity

DOI10.1080/02331888.2020.1720020zbMath1435.05178arXiv2001.03013OpenAlexW3003968061MaRDI QIDQ5222209

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

zbMATH Keywords

consistencyuniform distributionarc densityproximity catch digraphclass cover catch digraph

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On some subclasses of interval catch digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the distribution of the domination number for random class cover catch digraphs
• Classification of Imbalanced Data with a Geometric Digraph Family
• On vertex, edge, and vertex-edge random graphs
• The distribution of the relative arc density of a family of interval catch digraph based on uniform data
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Forbidden substructure for interval digraphs/bigraphs
• Domination in a digraph and in its reverse
• The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
• A CLT for a one-dimensional class cover problem
• A characterization of interval catch digraphs
• On the out-domination and in-domination numbers of a digraph
• Algorithms for interval catch digraphs
• Approximation algorithms for the class cover problem
• 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
• Uniquely Restricted Matchings in Interval Graphs
• A digraph represented by a family of boxes or spheres
• Circular‐arc digraphs: A characterization
• Entropy-based goodness-of-fit test for exponentiality
• Random Graphs for Statistical Pattern Recognition
• Total Domination in Graphs
• Topological Classification of RNA Structures via Intersection Graph
• Testing uniformity based on new entropy estimators
• Total domination in digraphs
• On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs

This page was built for publication: Domination number of an interval catch digraph family and its use for testing uniformity