arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.01710cond-mat.dis-nncond-mat.stat-mech
收藏

随机图上元胞自动机不动点的计数与寻找难度

Counting and Hardness-of-Finding Fixed Points in Cellular Automata on Random Graphs

Cédric Koller, Freya Behrens, Lenka Zdeborová

AI总结:

本文用RS与1RSB空腔方法刻画随机正则图上外全总istic元胞自动机不动点的数量、聚簇和冻结结构,并通过置信传播强化实验验证冻结变量与算法难度的关联。

摘要:

我们研究稀疏随机正则图上外全总istic元胞自动机的不动点。这些不动点可视为约束满足问题,其中每个变量都必须遵守相同的局部约束,而该约束仅取决于变量自身状态及其处于每种可能状态的邻居总数。该设定的例子包括独立集或同配/异配划分等经典问题。我们在大系统极限下,分别在复本对称(RS)和一步复本对称破缺(1RSB)假设下,使用空腔方法分析不动点的存在性与数量。该方法使我们能够刻画解空间的结构,特别是判断解是否聚簇,以及各簇中是否包含冻结变量。后一性质被推测与问题的典型算法难度有关。我们通过研究 belief-propagation reinforcement(置信传播强化)算法的性能,为这一主张提供实验证据;该算法是一种基于消息传递的约束满足问题求解器。

英文摘要:

We study the fixed points of outer-totalistic cellular automata on sparse random regular graphs. These can be seen as constraint satisfaction problems, where each variable must adhere to the same local constraint, which depends solely on its state and the total number of its neighbors in each possible state. Examples of this setting include classical problems such as independent sets or assortative/dissasortative partitions. We analyse the existence and number of fixed points in the large system limit using the cavity method, under both the replica symmetric (RS) and one-step replica symmetry breaking (1RSB) assumption. This method allows us to characterize the structure of the space of solutions, in particular, if the solutions are clustered and whether the clusters contain frozen variables. This last property is conjectured to be linked to the typical algorithmic hardness of the problem. We bring experimental evidence for this claim by studying the performance of the belief-propagation reinforcement algorithm, a message-passing-based solver for these constraint satisfaction problems.

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

↑