arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1101.3922math.COmath.PR
收藏

基于一维均匀数据的中心相似邻近捕捉有向图的相对密度分布

Distribution of the Relative Density of Central Similarity Proximity Catch Digraphs Based on One Dimensional Uniform Data

Elvan Ceyhan

摘要:

研究了基于一维数据的中心相似邻近捕获有向图(PCD)的图不变量的分布。中心相似PCD也是一种特殊类型的参数化随机有向图族,它定义了两个参数:中心性参数和扩张参数,对于一维数据,中心相似PCD也可以看作是一类区间捕捉有向图.我们考虑的图不变量是中心相似PCD的相对密度。证明了中心相似PCD的相对密度是一个U-统计量,并利用U-统计量的中心极限理论得到了在弱正则性条件下的渐近正态性.对于一维均匀数据,我们提供了中心相似PCD的相对密度的渐近分布的中心性和扩展参数的整个范围。因此,我们确定了最佳参数值,在该值处收敛(到正态性)的收敛速率最快。我们还提供了类覆盖捕捉有向图和扩展的中心相似PCD的连接到更高的维度。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑