title: Maximal entropy random walk improves efficiency of trapping in dendrimers.
abstract: We use maximal entropy random walk (MERW) to study the trapping problem in dendrimers modeled by Cayley trees with a deep trap fixed at the central node. We derive an explicit expression for the mean first passage time from any node to the trap, as well as an exact formula for the average trapping time (ATT), which is the average of the source-to-trap mean first passage time over all non-trap starting nodes. Based on the obtained closed-form solution for ATT, we further deduce an upper bound for the leading behavior of ATT, which is the fourth power of ln N, where N is the system size. This upper bound is much smaller than the ATT of trapping depicted by unbiased random walk in Cayley trees, the leading scaling of which is a linear function of N. These results show that MERW can substantially enhance the efficiency of trapping performed in dendrimers.
authors: School of Computer Science, Fudan University, Shanghai 200433, China.
authors: Xin
authors: X
authors: Peng
authors: School of Computer Science, Fudan University, Shanghai 200433, China.
authors: Zhongzhi
authors: Z
authors: Zhang