一个具有长距离相互作用的可解蒸发-沉积PCA
An exactly solvable evaporation-deposition PCA with long-distance interactions
AI总结:
本文提出了一种具有长距离相互作用的可解蒸发-沉积PCA模型,通过分析其马尔可夫链的遍历性和可逆性,给出了极限分布、配分函数和密度的显式公式,并为m=2情况提供了自由能的解析表达式。
摘要:
我们考虑一个在一维晶格上具有周期边界条件的概率细胞自动机(PCA)蒸发-沉积模型,该模型有n个站点。每个站点在每个时间步可以处于0或1两种状态中。固定一个正整数m≥2。在每个离散时间点,有两种类型的转换:(i)每个连续m个0的块中的第一个站点以概率p1变为1;(ii)每个连续(m-1)个0的块后紧接着一个1的块中的第一个站点以概率(1-p2)变为1。如同PCA一样,所有这些转换同时发生。我们证明所得到的离散时间马尔可夫链是遍历的,并给出了其极限分布、配分函数和密度的显式公式。我们还提出了该马尔可夫链可逆的必要且充分条件。对于m=2,我们为该模型提供了完全的解析自由能表达式。
英文摘要:
We consider a probabilistic cellular automaton (PCA) of evaporation-deposition on the one-dimensional lattice having $n$ sites with periodic boundary conditions, in which each site, during each epoch, can be in one of two states: $0$ and $1$. Fix a positive integer $m\geqslant 2$. There are two types of transitions at each discrete time, which are as follows: (i) the first site in every contiguous block of $m$ $0$s becomes a $1$ with probability $p_1$, and (ii) the first site in every contiguous block of $(m-1)$ $0$s followed immediately by a $1$ also becomes a $1$ with probability $(1-p_2)$. As in a PCA, all of these transitions occur simultaneously. We show that the resulting discrete-time Markov chain is ergodic, and we give an explicit formula for its limiting distribution, the partition function and the density. We also propose necessary and sufficient conditions for this Markov chain to be reversible. For $m=2$, we provide a fully analytical expression for the free energy of this model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。