随机布尔约束满足问题中的冻结变量
Frozen variables in random boolean constraint satisfaction problems
摘要:
我们确定了确切的冻结阈值,r^f,随机布尔约束满足问题,包括NAE-SAT和超图2-着色,当约束的大小是足够大的一个家庭的模型。如果我们族中随机CSP F的约束密度大于r^f,那么对于F的几乎每个解,线性数量的变量被冻结,这意味着它们的颜色不能通过一系列改变而改变,其中我们一次改变o(n)个变量,总是切换到另一个解。如果约束密度小于r^f,则几乎每个解都有o(n)个冻结变量。冻结是聚类现象的一个关键部分,这是由统计物理学的非严格技术假设的。对聚类的理解导致了高级统计学的发展,如调查传播。有人认为冻结阈值是一个精确的算法障碍:对于低于r^f的密度,随机CSP可以用非常简单的算法求解,而对于高于r^f的密度,需要更复杂的技术来处理冻结的簇。
英文摘要:
We determine the exact freezing threshold, r^f, for a family of models of random boolean constraint satisfaction problems, including NAE-SAT and hypergraph 2-colouring, when the constraint size is sufficiently large. If the constraint-density of a random CSP, F, in our family is greater than r^f then for almost every solution of F, a linear number of variables are frozen, meaning that their colours cannot be changed by a sequence of alterations in which we change o(n) variables at a time, always switching to another solution. If the constraint-density is less than r^f, then almost every solution has o(n) frozen variables. Freezing is a key part of the clustering phenomenon that is hypothesized by non-rigorous techniques from statistical physics. The understanding of clustering has led to the development of advanced heuristics such as Survey Propogation. It has been suggested that the freezing threshold is a precise algorithmic barrier: that for densities below r^f the random CSPs can be solved using very simple algorithms, while for densities above r^f one requires more sophisticated techniques in order to deal with frozen clusters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。