arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.17896math.STstat.OTstat.TH
收藏

随机几何图全局聚类系数的中心极限定理

Central limit theorem for the global clustering coefficient of random geometric graphs

The University of Texas at El Paso(埃尔帕索德克萨斯大学)

Mingao Yuan, Md. Niamul Islam Sium

AI总结:

本文研究了随机几何图全局聚类系数的中心极限定理,通过不同方法在不同情形下推导其渐近分布,并发现稀疏情形下两种图的聚类系数渐近相等。

摘要:

全局聚类系数是一种强大的度量指标,用于复杂网络的结构分析和比较。随机几何图提供了一个现实的框架,用于表示现实世界网络数据集中常见的空间约束和几何特性。在本文中,我们建立了随机几何图全局聚类系数的中心极限定理。我们的主要结果确定了收敛到标准正态分布所需的中心化和缩放序列。我们的方法根据不同的情形而变化:在密集情形下,我们采用Lyapunov CLT;在中间情形下,我们利用具有样本大小依赖核的U统计量的渐近理论;在稀疏情形下,我们使用矩方法推导渐近分布。值得注意的是,在密集情形下,非均匀和均匀随机几何图的收敛速率在密集情形下不同,但在稀疏情形下却相同。此外,我们发现均匀和非均匀RGGs的全局聚类系数在渐近上等于3/4。

英文摘要:

The global clustering coefficient serves as a powerful metric for the structural analysis and comparison of complex networks. Random geometric graphs offer a realistic framework for representing the spatial constraints and geometry often found in real-world network datasets. In this paper, we establish a central limit theorem for the global clustering coefficient of random geometric graphs. Our main result identifies the centering and scaling sequences required for convergence in law to the standard normal distribution. Our approach varies by regime: in the dense case, we employ the Lyapunov CLT; in the intermediate case, we utilize the asymptotic theory of $U$-statistics with sample-size-dependent kernels; and in the sparse regime, we use the method of moments to derive the asymptotic distribution. Notably, the convergence rates for non-uniform and uniform random geometric graphs diverge in the dense regime, yet they coincide in the sparse regime. In addition, we find that the global clustering coefficient for both uniform and non-uniform RGGs is asymptotically equal to $3/4$

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

↑