arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0910.5311math.COmath.PR
收藏

随机交图与G(n,p)的等价性

Equivalence of the random intersection graph and G(n,p)

Katarzyna Rybarczyk

摘要:

本文解决了Fill,Scheinerman和Singer-Cohen提出的猜想,证明了随机交图G(n,m,p)与$m >= n^3$和每条边独立出现的图的锐门限函数的等价性.此外,我们证明了一些额外的假设下更尖锐的等价结果。

英文摘要:

We solve the conjecture posed by Fill, Scheinerman and Singer-Cohen and show the equivalence of the sharp threshold functions of the random intersection graph G(n,m,p) with $m >= n^3$ and a graph in which each edge appears independently. Moreover we prove sharper equivalence results under some additional assumptions.

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

↑