Name
Abstract | ||
|---|---|---|
Previous work shows that the mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) in uncorrelated random scale-free networks is closely related to the exponent gamma of power-law degree distribution P(k) similar to k(-gamma), which describes the extent of heterogeneity of scale-free network structure. However, extensive empirical research indicates that real networked systems also display ubiquitous degree correlations. In this paper, we address the trapping issue on the Koch networks, which is a special random walk with one trap fixed at a hub node. The Koch networks are power-law with the characteristic exponent gamma in the range between 2 and 3, they are either assortative or disassortative. We calculate exactly the MFPT that is the average of first-passage time from all other nodes to the trap. The obtained explicit solution shows that in large networks the MFPT varies lineally with node number N, which is obviously independent of gamma and is sharp contrast to the scaling behavior of MFPT observed for uncorrelated random scale-free networks, where gamma influences qualitatively the MFPT of trapping problem. (C) 2010 American Institute of Physics. [doi:10.1063/1.3493406] |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1063/1.3493406 | CHAOS |
Keywords | DocType | Volume |
random walks,mean first-passage time,scale-free networks,complex networks | Journal | 20 |
Issue | ISSN | Citations |
4 | 1054-1500 | 2 |
PageRank | References | Authors |
0.50 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhongzhi Zhang | 1 | 85 | 22.02 |
| Shuyang Gao | 2 | 2 | 0.50 |
| Wenlei Xie | 3 | 486 | 22.55 |