16 citations · 69 across the 38 of their papers we have counts for
5 papers · 1 filter
On the Distribution of the Number of Copies of Weakly Connected Digraphs in Random NN Digraphs
Selim Bahadır, Elvan Ceyhan
In a digraph with vertices, a minuscule construct is a subdigraph with vertices. We study the number of copies of a minuscule constructs in nearest neighbor (NN)…
On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data
Selim Bahadır, Elvan Ceyhan
For a random sample of points in , we consider the number of pairs whose members are nearest neighbors (NN) to each other and the number of pairs sharing a common NN. T…
Distribution of Relative Edge Density of the Graphs Based on a Random Digraph Family
Elvan Ceyhan
The vertex-random graphs called proximity catch digraphs (PCDs) have been introduced recently and have applications in pattern recognition and spatial pattern analysis. A PCD is a…
A Probabilistic Characterization of Random Proximity Catch Digraphs and the Associated Tools
Elvan Ceyhan
Proximity catch digraphs (PCDs) are based on proximity maps which yield proximity regions and are special types of proximity graphs. PCDs are based on the relative allocation of po…
The Distribution of the Domination Number of Class Cover Catch Digraphs for Non-uniform One-dimensional Data
Elvan Ceyhan
For two or more classes of points in with , the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with…