Mean Hitting Time for Random Walks on a Class of Sparse Networks

Mean Hitting Time for Random Walks on a Class of Sparse Networks

For random walks on a complex network, the configuration of a network that provides optimal or suboptimal navigation efficiency is meaningful research. It has been proven that a complete graph has the exact minimal mean hitting time, which grows linearly with the network order. In this paper, we pre...

Full description

Bibliographic Details
Main Authors: Jing Su, Xiaomin Wang, Bing Yao
Format: Article
Language:English
Published: MDPI AG 2021-12-01
Series:Entropy
Subjects:
complex network
graphic operation
random walk
mean hitting time
Kirchhoff index
Online Access:https://www.mdpi.com/1099-4300/24/1/34

Internet

https://www.mdpi.com/1099-4300/24/1/34

Similar Items