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

DOI10.1016/J.STAMET.2016.07.003zbMATH Open1487.05241OpenAlexW2490413657MaRDI QIDQ670163FDOQ670163

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

Recommendations

• The distribution of the relative arc density of a family of interval catch digraph based on uniform data
• Comparison of relative density of two random geometric digraph families in testing spatial clustering
• An investigation of new graph invariants related to the domination number of random proximity catch digraphs
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
• Classification using proximity catch digraphs

zbMATH Keywords

asymptotic normalitycentral limit theorem\(U\)-statisticreflexivityunderlying grapharc densityDelaunay tessellation and triangulationproximity catch digraph

Mathematics Subject Classification ID

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

Cites Work

• Statistical mechanics of complex networks
• Random Geometric Graphs
• The relative neighbourhood graph of a finite planar set
• 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
• Probability Inequalities for Sums of Bounded Random Variables
• A new family of random graphs for testing spatial segregation
• A Class of Statistics with Asymptotically Normal Distribution
• 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
• Collective dynamics of ‘small-world’ networks
• Approximation algorithms for the class cover problem
• On the Minimal Density of Triangles in Graphs
• On vertex, edge, and vertex-edge random graphs
• Extension of one-dimensional proximity regions to higher dimensions
• Local Density in Graphs with Forbidden Subgraphs
• The Berry-Esseen theorem for U-statistics
• The edge-density of 4-critical planar graphs
• Sphere of influence graphs: Edge density and clique size

Cited In (3)

• pcds.ugraph
• Chaotic Maps: Applications to Cryptography and Network Generation for the Graph Laplacian Quantum States
• Edge distribution and density in the characteristic sequence

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

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