In this paper, we study mean first-passage time (MFPT) for random walks on a network through edge iteration. The feature of this kind of network is that every existing edge gives birth to finite nodes at each step. According to the network structures, we obtain the analytical expression for MFPT, which shows that the MFPT grows as a power-law function with the number of nodes in the large limit of...
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.