arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1509.07019math.PR
收藏

度分布和聚类可调的随机交图

Random intersection graphs with tunable degree distribution and clustering

Maria Deijfen, Willemien Kets

摘要:

随机交图是通过独立地分配给每个顶点的一个子集的给定集合和绘制两个顶点之间的边当且仅当它们各自的子集相交。本文提出了一个模型,其中每个顶点被赋予一个随机的权重,与较大的权重顶点更有可能被分配到大的子集。一个给定的顶点的程度的分布的特点,并示出依赖于顶点的重量。特别地,如果权重分布是幂律,则度分布也将是幂律。此外,在图中的聚类的渐近表达式推导。通过调整模型的参数,可以生成具有任意聚类、期望度和(在幂律情况下)尾指数的图。

英文摘要:

A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in which each vertex is given a random weight, and vertices with larger weights are more likely to be assigned large subsets. The distribution of the degree of a given vertex is characterized and is shown to depend on the weight of the vertex. In particular, if the weight distribution is a power law, the degree distribution will be so as well. Furthermore, an asymptotic expression for the clustering in the graph is derived. By tuning the parameters of the model, it is possible to generate a graph with arbitrary clustering, expected degree and -- in the power law case -- tail exponent.

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

↑