arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.1160cond-mat.stat-mechcond-mat.dis-nn
收藏

最大熵随机游动:动力学的可解情形

Maximal Entropy Random Walk: solvable cases of dynamics

Jeremi K. Ochab

摘要:

本文主要研究了Cayley树和梯形图两种网络模型上的两类随机游动:一般随机游动(GRW)和最大熵随机游动(MERW)的动力学性质。MERW的平稳概率分布由图的邻接矩阵的最大特征值λ_0的特征向量的平方分量给出,而概率分布向平稳状态逼近的动力学依赖于第二大特征值λ_1。首先,我们给出了具有任意分支数、根度和代数的Cayley树的解析解。我们确定了三个政权的树结构,导致不同的静态和动态的MERW,这是由于强,临界,和弱分支根。我们展示了如何松弛时间,一般短MERW比GRW,规模与图形的大小。其次,我们给出了具有对称缺陷的梯形图的数值结果。MERW显示出明显的弛豫时间与缺陷区域的大小呈指数增长,这表明在高熵完整区域内捕获颗粒,并且其逃逸类似于通过势垒的量子隧穿。GRW表现出标准的扩散依赖性,无论缺陷。

英文摘要:

We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given by the squared components of the eigenvector associated with the largest eigenvalue λ_0 of the adjacency matrix of a graph, while the dynamics of the probability distribution approaching to the stationary state depends on the second largest eigenvalue λ_1. Firstly, we give analytic solutions for Cayley trees with arbitrary branching number, root degree, and number of generations. We determine three regimes of a tree structure that result in different statics and dynamics of MERW, which are due to strongly, critically, and weakly branched roots. We show how the relaxation times, generically shorter for MERW than for GRW, scale with the graph size. Secondly, we give numerical results for ladder graphs with symmetric defects. MERW shows a clear exponential growth of the relaxation time with the size of defective regions, which indicates trapping of a particle within highly entropic intact region and its escaping that resembles quantum tunneling through a potential barrier. GRW shows standard diffusive dependence irrespective of the defects.

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

↑