聚类功能:社会影响力的衡量标准
Clustering function: a measure of social influence
摘要:
在真实网络中,一个常用的邻接关系的统计依赖特性,即聚类系数,评估给定顶点的两个邻居相邻的机会。通过考虑两个随机选择的顶点相邻的条件概率,得到一个扩展,因为它们有r个共同的邻居。我们将这样的概率表示为cl(r),并将r-> cl(r)称为聚类函数。我们比较了几个网络的聚类功能具有不可忽略的聚类系数。它们显示出相似的模式和令人惊讶的规律性。我们建立了相关随机交图模型的聚类函数的一阶渐近(当顶点数趋于无穷大时),该模型允许非零聚类系数和具有有限二阶矩的渐近度分布.
英文摘要:
A commonly used characteristic of statistical dependence of adjacency relations in real networks, the clustering coefficient, evaluates chances that two neighbours of a given vertex are adjacent. An extension is obtained by considering conditional probabilities that two randomly chosen vertices are adjacent given that they have r common neighbours. We denote such probabilities cl(r) and call r-> cl(r) the clustering function. We compare clustering functions of several networks having non-negligible clustering coefficient. They show similar patterns and surprising regularity. We establish a first order asymptotic (as the number of vertices tends to infinity) of the clustering function of related random intersection graph models admitting nonvanishing clustering coefficient and asymptotic degree distribution having a finite second moment.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。