閱讀全文 | |
篇名 |
Random walks on the folded hypercube
|
---|---|
並列篇名 | Random walks on the folded hypercube |
作者 | Hong Chen、Xiaoyan Li、Cheng-Kuan Lin |
英文摘要 | Random walks are basic mechanism for many dynamic processes on the network. In this paper, we study the global mean first-passage time (GMFPT) of random walks on the n-dimensional folded hypercube FQn. FQn is a variation of the hypercube Qn by adding complementary edges, and characterized with the superiorities of smaller diameter and higher connectivity than the hypercube. We initiate a more concise formula to the Kirchhoff index by using the spectra of the Laplace matrix of FQn. We also obtain the explicit formula to GMFPT, and the exponent of scaling efficiency characterizing the random walks is further determined, finding that it takes less time when random walks on FQn than on Qn. Moreover, we explore random walks on the FQn considering a given trap. Finally, we make some comparison with Qn in Kirchhoff index, noticing a more effective traffic on FQn. |
起訖頁 | 1985-1992 |
關鍵詞 | Random walks、Folded hypercube、Mean first-passage time、Kirchhoff index |
刊名 | 網際網路技術學刊 |
期數 | 201911 (20:6期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 上一篇
| Contrasting the Motivations of Using Social Networking Sites between Western and Eastern Countries |
該期刊 下一篇
| The constructive algorithm of vertex-disjoint paths in the generalized hypercube under restricted connectivity |