On the Structure and Computation of Random Walk Times in Finite Graphs

DOI10.1109/TAC.2019.2895299zbMath1482.90052arXiv1709.01633OpenAlexW2962738563WikidataQ128536225 ScholiaQ128536225MaRDI QIDQ5211207

No author found.

Publication date: 28 January 2020

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.01633

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Markov and semi-Markov decision processes (90C40) Random walks on graphs (05C81)

Related Items (1)

A first hitting time approach to finding effective spreaders in a network

This page was built for publication: On the Structure and Computation of Random Walk Times in Finite Graphs