arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.01102math.CO
收藏

非常稀疏随机图的一元二阶性质

Monadic second-order properties of very sparse random graphs

L. B. Ostrovsky, M. E. Zhukovskii

摘要:

研究了Erdos-Renyi随机图G(n,n^{-a})的一阶和一元二阶性质的渐近概率.随机图服从FO(MSO)0 - 1 k-律,如果对于任何一阶(一元二阶)公式,G(n,n^{-a})以概率趋于0或1为真。零-一k-律只在一阶语言和a < 1的情况下得到了很好的研究。当a > 1时,我们得到了新的0 - 1 k-律(一阶语言和一元二阶语言)。这些结果的证明是基于已有的一阶等价类的研究和我们的一元二阶等价类的研究。各自的结果本身是有意义的。

英文摘要:

We study asymptotical probabilities of first order and monadic second order properties of Erdos-Renyi random graph G(n,n^{-a}). The random graph obeys FO (MSO) zero-one k-law if for any first order (monadic second order) formulae it is true for G(n,n^{-a}) with probability tending to 0 or to 1. Zero-one k-laws are well studied only for the first order language and a < 1. We obtain new zero-one k-laws (both for first order and monadic second order languages) when a > 1. Proofs of these results are based on the existed study of first order equivalence classes and our study of monadic second order equivalence classes. The respective results are of interest by themselves.

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

↑