Random walks on dual Sierpinski gaskets |
| |
| Authors: | Shunqi Wu Zhongzhi Zhang Guanrong Chen |
| |
| Institution: | 1.School of Computer Science,Fudan University,Shanghai,P.R. China;2.Shanghai Key Lab of Intelligent Information Processing,Fudan University,Shanghai,P.R. China;3.Department of Electronic Engineering,City University of Hong Kong,Hong Kong,P.R. China |
| |
| Abstract: | We study an unbiased random walk on dual Sierpinski gaskets embedded in d-dimensional Euclidean spaces. We first determine the mean first-passage time (MFPT) between a particular pair of nodes based
on the connection between the MFPTs and the effective resistance. Then, by using the Laplacian spectra, we evaluate analytically
the global MFPT (GMFPT), i.e., MFPT between two nodes averaged over all node pairs. Concerning these two quantities, we obtain
explicit solutions and show how they vary with the number of network nodes. Finally, we relate our results for the case of
d = 2 to the well-known Hanoi Towers problem. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
