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

2- SAT阈值的分支过程方法

Branching Process approach for 2-SAT thresholds

Elchanan Mossel, Arnab Sen

摘要:

众所周知,当$n$趋于无穷大时,$n$变量上的随机2-SAT公式的可满足性概率(其中每个子句以概率$α/2n$独立出现)在$α=1$处表现出尖锐的阈值。我们研究了一个更一般的2-SAT模型,其中每个子句独立出现,但概率为$α_i/2n$,其中$i \in \{0,1,2\}$是该子句中正文字的数量。我们推广了Verhoeven(99)的分支过程的论点,以确定该模型的可满足性阈值的分支矩阵的最大特征值。

英文摘要:

It is well known that, as $n$ tends to infinity, the probability of satisfiability for a random 2-SAT formula on $n$ variables, where each clause occurs independently with probability $α/2n$, exhibits a sharp threshold at $α=1$. We study a more general 2-SAT model in which each clause occurs independently but with probability $α_i/2n$ where $i \in \{0,1,2\}$ is the number of positive literals in that clause. We generalize branching process arguments by Verhoeven(99) to determine the satisfiability threshold for this model in terms of the maximum eigenvalue of the branching matrix.

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

↑