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

稀疏随机图的一阶可区分性

First order distinguishability of sparse random graphs

Tal Hershko, Maksim Zhukovskii

AI总结:

本研究针对稀疏随机图的一阶可区分性问题,揭示区分两个$G(n,n^{-α})$样本的一阶语句最小区词深度与α的有理逼近程度相关,并通过新型随机算法和对称群研究方法给出了不同α对应的深度界。

摘要:

我们研究通过一阶(FO)语句区分二项随机图$G(n,p)$的两个独立样本$\boldsymbol{G}_n^1,\boldsymbol{G}_n^2$的问题。Shelah和Spencer证明,对于常数$\boldsymbol{\u03b1}\u2208(0,1)$,$G(n,n^{-\u03b1})$服从FO零一律当且仅当$\u03b1$为无理数。因此,对于无理数$\u03b1\u2208(0,1)$,当$n\to\boldsymbol{\u221e}$时,任意固定的FO语句都无法以渐近概率1(w.h.p.)区分$\boldsymbol{G}_n^1,\boldsymbol{G}_n^2$。我们证明,区分$\boldsymbol{G}_n^1,\boldsymbol{G}_n^2$的FO语句$\boldsymbol{\u03c6}=\u03c6(\boldsymbol{G}_n^1,\boldsymbol{G}_n^2)$的最小区词深度$\boldsymbol{k}_\u03b1$取决于$\u03b1$可被有理数逼近的程度:(1) 对所有非刘维尔(non-Liouville)数$\u03b1\u2208(0,1)$,w.h.p.下$\boldsymbol{k}_\u03b1=\boldsymbol{\u03a9}(\boldsymbol{\u2113\u2113\u2113 n})$;(2) 存在无理数$\u03b1\u2208(0,1)$,其$\boldsymbol{k}_\u03b1$在w.h.p.下增长速度可任意慢;(3) 对所有$\u03b1\u2208(0,1)$,$\boldsymbol{k}_\u03b1=O_p(\frac{\u2113 n}{\u2113\u2113 n})$。我们证明的核心要素是一种生成非对称严格平衡图的新型随机算法,以及研究随机扰动图对称群的新方法。

英文摘要:

We study the problem of distinguishing between two independent samples $\mathbf{G}_n^1,\mathbf{G}_n^2$ of a binomial random graph $G(n,p)$ by first order (FO) sentences. Shelah and Spencer proved that, for a constant $α\in(0,1)$, $G(n,n^{-α})$ obeys FO zero-one law if and only if $α$ is irrational. Therefore, for irrational $α\in(0,1)$, any fixed FO sentence does not distinguish between $\mathbf{G}_n^1,\mathbf{G}_n^2$ with asymptotical probability 1 (w.h.p.) as $n\to\infty$. We show that the minimum quantifier depth $\mathbf{k}_α$ of a FO sentence $φ=φ(\mathbf{G}_n^1,\mathbf{G}_n^2)$ distinguishing between $\mathbf{G}_n^1,\mathbf{G}_n^2$ depends on how closely $α$ can be approximated by rationals: (1) for all non-Liouville $α\in(0,1)$, $\mathbf{k}_α=Ω(\ln\ln\ln n)$ w.h.p.; (2) there are irrational $α\in(0,1)$ with $\mathbf{k}_α$ that grow arbitrarily slowly w.h.p.; (3) $\mathbf{k}_α=O_p(\frac{\ln n}{\ln\ln n})$ for all $α\in(0,1)$. The main ingredients in our proofs are a novel randomized algorithm that generates asymmetric strictly balanced graphs as well as a new method to study symmetry groups of randomly perturbed graphs.

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

↑