Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant
From MaRDI portal
Publication:2982465
DOI10.1109/TAC.2015.2426317zbMath1360.60137MaRDI QIDQ2982465
Pushkarini Agharkar, Bullo, Francesco, Rushabh Patel
Publication date: 16 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (8)
The Hitting Time of Multiple Random Walks ⋮ Kemeny's constant for nonbacktracking random walks ⋮ On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival ⋮ Modeling spatial networks by contact graphs of disk packings ⋮ Kemeny's constant for several families of graphs and real-world networks ⋮ Spectral analysis for weighted iterated q-triangulation networks ⋮ A 1-separation formula for the graph Kemeny constant and Braess edges ⋮ Kemeny's constant for a graph with bridges
This page was built for publication: Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant
