平均闭合系数的中心极限定理
Central limit theorem for the average closure coefficient
AI总结:
本文研究异质 Erdös-Rényi 随机图中平均闭合系数的渐近分布,证明其标准化统计量依分布收敛至标准正态,并揭示方差存在与平均聚类系数相同的相变。
摘要:
许多现实世界网络表现出边聚类现象,这通常由平均聚类系数来衡量。最近,一种替代度量——平均闭合系数被提出,用于量化局部聚类。研究表明,平均闭合系数具有许多有用性质,并能捕捉经典平均聚类系数所遗漏的互补信息。本文研究异质 Erdös-Rényi 随机图的平均闭合系数的渐近分布。我们证明标准化后的平均闭合系数依分布收敛于标准正态分布。在 Erdös-Rényi 随机图中,平均闭合系数的方差表现出与平均聚类系数相同的相变现象。
英文摘要:
Many real-world networks exhibit the phenomenon of edge clustering, which is typically measured by the average clustering coefficient. Recently, an alternative measure, the average closure coefficient, is proposed to quantify local clustering. It is shown that the average closure coefficient possesses a number of useful properties and can capture complementary information missed by the classical average clustering coefficient. In this paper, we study the asymptotic distribution of the average closure coefficient of a heterogeneous Erdös-Rényi random graph. We prove that the standardized average closure coefficient converges in distribution to the standard normal distribution. In the Erdös-Rényi random graph, the variance of the average closure coefficient exhibits the same phase transition phenomenon as the average clustering coefficient.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。