Low-Mean Hitting Time for Random Walks on Heterogeneous Networks

DOI10.1109/TIT.2019.2925610MaRDI QIDQ5211483zbMATH OpenOpenAlexWikidataFDO

Authors Yibin Sheng, Zhongzhi 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

\(N\)-node networkscomplete graphminimum mean hitting time

Mathematics Subject Classification ID

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

Cited in

(10)

• Mean first passage time of preferential random walks on complex networks with applications
• The distribution of first hitting times of random walks on directed Erdős–Rényi networks
• 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
• First encounters on Watts-Strogatz networks and Barabási-Albert networks
• Resistance distances in directed graphs: definitions, properties, and applications
• Optimization of transport efficiency on bundled networks
• First passage properties of d-dimensional finite combs with different growth modes
• Maximizing the smallest eigenvalue of grounded Laplacian matrix

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211483)