稀疏随机交图的分类性与聚类
Assortativity and clustering of sparse random intersection graphs
摘要：
我们考虑稀疏随机交图的性质，聚类系数不为零的节点数趋于无穷大。我们发现明确的渐近表达式的相关系数的程度相邻节点（称为的相关系数），预期数量的共同邻居的相邻节点，和预期程度的邻居的节点的一个给定的程度k。这些表达式是用渐近度分布来表示的，或者用定义底层随机图模型的参数来表示。
英文摘要：
We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of adjacent nodes (called the assortativity coefficient), the expected number of common neighbours of adjacent nodes, and the expected degree of a neighbour of a node of a given degree k. These expressions are written in terms of the asymptotic degree distribution and, alternatively, in terms of the parameters defining the underlying random graph model.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
