Low-Mean Hitting Time for Random Walks on Heterogeneous Networks

DOI10.1109/TIT.2019.2925610zbMath1433.05289OpenAlexW2954184251WikidataQ127612166 ScholiaQ127612166MaRDI QIDQ5211483

Yibin Sheng, Zhong-Zhi Zhang

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2019.2925610

zbMATH Keywords

complete graph\(N\)-node networksminimum mean hitting time

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Related Items (3)

Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition ⋮ Modeling spatial networks by contact graphs of disk packings ⋮ Improvement of quantum walks search algorithm in single-marked vertex graph

This page was built for publication: Low-Mean Hitting Time for Random Walks on Heterogeneous Networks