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

均匀和非均匀梳刷上的随机游动

Random walks on uniform and non-uniform combs and brushes

Alex V. Plyukhin, Dan Plyukhin

摘要:

我们考虑随机游动梳状和刷状图组成的一个基地(分形维数$D$)装饰与附加的侧群。该图的特征还在于一组锚点的分形维数$D_a$,其中侧基连接到基地。两种类型的图被认为是。第一种类型的图在锚点周期性地分布在基上的意义上是均匀的,并且因此形成具有维度$D_a=D$的基的子集。第二种类型的图以规则但不均匀的方式用侧群装饰:锚点集的分形维数小于基$D_a<D$的分形维数。对于均匀图,Forte等人提出的用于评估梳状物($D=1$)的子扩散指数的定性方法被扩展用于刷状物($D>1$),并且对Sierpinski刷状物(具有构建在相同Sierpinski垫圈上的基和锚集)进行数值测试。作为非均匀图的一个例子,我们考虑康托梳组成的一维基地和侧群,后者附在前者的锚点形成康托集。这个和其他非均匀系统的一个独特的功能是一个长寿命的超扩散运输时,侧组是一个有限的大小。

英文摘要:

We consider random walks on comb- and brush-like graphs consisting of a base (of fractal dimension $D$) decorated with attached side-groups. The graphs are also characterized by the fractal dimension $D_a$ of a set of anchor points where side-groups are attached to the base. Two types of graphs are considered. Graphs of the first type are uniform in the sense that anchor points are distributed periodically over the base, and thus form a subset of the base with dimension $D_a=D$. Graphs of the second type are decorated with side-groups in a regular yet non-uniform way: the set of anchor points has fractal dimension smaller than that of the base, $D_a<D$. For uniform graphs, a qualitative method for evaluating the sub-diffusion exponent suggested by Forte et al. for combs ($D=1$) is extended for brushes ($D>1$) and numerically tested for the Sierpinski brush (with the base and anchor set built on the same Sierpinski gasket). As an example of nonuniform graphs we consider the Cantor comb composed of a one-dimensional base and side-groups, the latter attached to the former at anchor points forming the Cantor set. A peculiar feature of this and other nonuniform systems is a long-lived regime of super-diffusive transport when side-groups are of a finite size.

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

↑