Mathematics – Combinatorics
Scientific paper
2011-01-20
Mathematics
Combinatorics
28 pages, 6 figures
Scientific paper
We consider the distribution of a graph invariant of central similarity proximity catch digraphs (PCDs) based on one dimensional data. The central similarity PCDs are also a special type of parameterized random digraph family defined with two parameters, a centrality parameter and an expansion parameter, and for one dimensional data, central similarity PCDs can also be viewed as a type of interval catch digraphs. The graph invariant we consider is the relative density of central similarity PCDs. We prove that relative density of central similarity PCDs is a U-statistic and obtain the asymptotic normality under mild regularity conditions using the central limit theory of U-statistics. For one dimensional uniform data, we provide the asymptotic distribution of the relative density of the central similarity PCDs for the entire ranges of centrality and expansion parameters. Consequently, we determine the optimal parameter values at which the rate of convergence (to normality) is fastest. We also provide the connection with class cover catch digraphs and the extension of central similarity PCDs to higher dimensions.
No associations
LandOfFree
Distribution of the Relative Density of Central Similarity Proximity Catch Digraphs Based on One Dimensional Uniform Data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Distribution of the Relative Density of Central Similarity Proximity Catch Digraphs Based on One Dimensional Uniform Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distribution of the Relative Density of Central Similarity Proximity Catch Digraphs Based on One Dimensional Uniform Data will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-333689