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

具有稀疏社区的随机交图的参数估计

Parameter estimators of random intersection graphs with thinned communities

Joona Karjalainen, Johan S. H. van Leeuwaarden, Lasse Leskelä

摘要:

研究了由大量随机大小的重叠社区组成的统计网络模型,其中共享社区的任意一对节点通过社区以概率$q$连接。在$q=1$的特殊情况下,该模型简化为一个随机交图,这是已知的,以产生高层次的传递性,也在稀疏的上下文中。参数$q$增加了一个自由度,并导致一个简约的和易于分析的网络模型,具有可调的密度,传递性和度波动。我们证明了该模型的参数可以一致估计在大和稀疏的限制制度使用矩估计的基础上部分观察到的密度的链接,2星,和三角形。

英文摘要:

This paper studies a statistical network model generated by a large number of randomly sized overlapping communities, where any pair of nodes sharing a community is linked with probability $q$ via the community. In the special case with $q=1$ the model reduces to a random intersection graph which is known to generate high levels of transitivity also in the sparse context. The parameter $q$ adds a degree of freedom and leads to a parsimonious and analytically tractable network model with tunable density, transitivity, and degree fluctuations. We prove that the parameters of this model can be consistently estimated in the large and sparse limiting regime using moment estimators based on partially observed densities of links, 2-stars, and triangles.

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

↑