arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.02572cond-mat.stat-mech
收藏

欧氏、分形和随机格上的随机序列吸附

Random sequential adsorption on Euclidean, fractal and random lattices

Pedro M. Pasinetti, Lucia S. Ramirez, Paulo M. Centres, Antonio J. Ramirez-Pastor, Gabriel A. Cwilich

摘要:

研究了不同形状和大小的物体在欧氏、分形和随机晶格上的不可逆吸附。吸附过程采用随机序列吸附(RSA)算法进行模拟。物体被吸附在一维、二维和三维的欧几里得晶格上,吸附在尺寸$d$在1和2之间的Sierpinski地毯上,以及吸附在Erdos Renyi随机图上。对于欧几里德和分形晶格,位点的数量是$M=L^d$,其中$L$是系统的特征长度。在随机图的情况下,它不存在这样的特征长度,并且衬底可以由固定的一组$M$顶点(站点)和平均连通性(或度)$g$来表征。本文集中于测量(1)由$L^d(M)$元素组成的晶格到达覆盖$θ$的概率$W_{L(M)}(θ)$,以及(2)表征所谓的“干扰转变”的指数$ν_j$。针对欧几里得、分形和随机网格获得的结果表明,从干扰概率$W_{L(M)}(θ)$推导出的主要量的行为渐进为$M^{1/2}$。在欧几里得格和分形格的情况下,可以定义$L$和$d$,渐近行为可以写为$M^{1/2} = L^{d/2}=L^{1/ν_j}$和$ν_j=2/d$。

英文摘要:

Irreversible adsorption of objects of different shapes and sizes on Euclidean, fractal and random lattices is studied. The adsorption process is modeled by using random sequential adsorption (RSA) algorithm. Objects are adsorbed on one-, two-, and three-dimensional Euclidean lattices, on Sierpinski carpets having dimension $d$ between 1 and 2, and on Erdos-Renyi random graphs. The number of sites is $M=L^d$ for Euclidean and fractal lattices, where $L$ is a characteristic length of the system. In the case of random graphs it does not exist such characteristic length, and the substrate can be characterized by a fixed set of $M$ vertices (sites) and an average connectivity (or degree) $g$. The paper concentrates on measuring (1) the probability $W_{L(M)}(θ)$ that a lattice composed of $L^d(M)$ elements reaches a coverage $θ$, and (2) the exponent $ν_j$ characterizing the so-called "jamming transition". The results obtained for Euclidean, fractal and random lattices indicate that the main quantities derived from the jamming probability $W_{L(M)}(θ)$ behave asymptotically as $M^{1/2}$. In the case of Euclidean and fractal lattices, where $L$ and $d$ can be defined, the asymptotic behavior can be written as $M^{1/2} = L^{d/2}=L^{1/ν_j}$, and $ν_j=2/d$.

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

↑