On the Structure and Computation of Random Walk Times in Finite Graphs
On the Structure and Computation of Random Walk Times in Finite Graphs is a scholarly work, published in 2019 in ''IEEE Transactions on Automatic Control''. The main subjects of the publication include computation, graph theory, set, cover, finite set, random walk, computer science, convergence, hitting time, submodular set function, Markov chain, discrete mathematics, mathematics, algorithm, combinatorial optimization, and combinatorics. The authors investigate the computational structure of the random walk times as a function of the set of target nodes, and find that the commute, hitting, and cover times all exhibit submodular structure, even in non-stationary random walks.