arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.08609cond-mat.stat-mechmath.PR
收藏

一维随机序列吸附中的大偏差

Large Deviations in One-Dimensional Random Sequential Adsorption

P. L. Krapivsky

摘要:

在随机顺序吸附(RSA)中,物体被随机、不可逆和顺序地沉积;导致与先前沉积的物体重叠的尝试被丢弃。该过程继续,直到系统达到堵塞状态,此时不可能进一步添加。我们分析了一类格型RSA模型,在该模型中,当至少$b$左右相邻的站点未被占用时,允许在一个段中的空站点上着陆。对于极小模型($b=1$),我们计算了占用数的全计数统计量。我们减少了完整的计数统计的Riccati方程,出现解析可解时,只有$b=1$的确定。我们开发了一个扰动程序,在原则上,允许一个连续确定累积量,我们计算所有$b$的占用数的方差。

英文摘要:

In random sequential adsorption (RSA), objects are deposited randomly, irreversibly, and sequentially; attempts leading to an overlap with previously deposited objects are discarded. The process continues until the system reaches a jammed state when no further additions are possible. We analyze a class of lattice RSA models in which landing on an empty site in a segment is allowed when at least $b$ neighboring sites on the left and the right are unoccupied. For the minimal model ($b=1$), we compute the full counting statistics of the occupation number. We reduce the determination of the full counting statistics to a Riccati equation that appears analytically solvable only when $b=1$. We develop a perturbation procedure which, in principle, allows one to determine cumulants consecutively, and we compute the variance of the occupation number for all $b$.

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

↑