Edge density of new graph types based on a random digraph family

DOI10.1016/J.STAMET.2016.07.003zbMath1487.05241OpenAlexW2490413657MaRDI QIDQ670163

Elvan Ceyhan

Publication date: 18 March 2019

Published in: Statistical Methodology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.stamet.2016.07.003

zbMATH Keywords

asymptotic normalityreflexivitycentral limit theorem\(U\)-statisticunderlying grapharc densityDelaunay tessellation and triangulationproximity catch digraph

Mathematics Subject Classification ID

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

Related Items (2)

pcds.ugraph ⋮ Chaotic Maps: Applications to Cryptography and Network Generation for the Graph Laplacian Quantum States

Cites Work

• On the distribution of the domination number for random class cover catch digraphs
• On vertex, edge, and vertex-edge random graphs
• Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
• Extension of one-dimensional proximity regions to higher dimensions
• The relative neighbourhood graph of a finite planar set
• The Berry-Esseen theorem for U-statistics
• Sphere of influence graphs: Edge density and clique size
• Approximation algorithms for the class cover problem
• Classification using class cover catch digraphs
• The edge-density of 4-critical planar graphs
• 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
• Statistical mechanics of complex networks
• On the Minimal Density of Triangles in Graphs
• Random Geometric Graphs
• Local Density in Graphs with Forbidden Subgraphs
• Probability Inequalities for Sums of Bounded Random Variables
• Collective dynamics of ‘small-world’ networks
• A new family of random graphs for testing spatial segregation
• A Class of Statistics with Asymptotically Normal Distribution

This page was built for publication: Edge density of new graph types based on a random digraph family