Volume 90, Number 4, May 2010
|Number of page(s)||6|
|Published online||16 June 2010|
Asymptotic analysis of first passage time in complex networks
Department of Physics, The Hong Kong University of Science and Technology - Hong Kong, China
Accepted: 18 May 2010
The first passage time (FPT) distribution for random walks in complex networks is calculated through an asymptotic analysis. For a network with size N and short relaxation time τ ≪ N, the computed mean first passage time (MFPT), which is the inverse of the decay rate of FPT distribution, is inversely proportional to the degree of the destination. These results are verified numerically for the paradigmatic networks with excellent agreement. We show that the range of validity of the analytical results covers networks that have short relaxation time and high mean degree, which turn out to be valid to many real networks.
PACS: 05.40.Fb – Random walks and Levy flights / 89.75.Hc – Networks and genealogical trees / 87.10.-e – General theory and mathematical aspects
© EPLA, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.