On the fastest finite Markov processes
From MaRDI portal
Publication:2326015
DOI10.1016/j.jmaa.2019.123488zbMath1477.60118arXiv1608.07958OpenAlexW2972990006MaRDI QIDQ2326015
Laurent Miclo, Vivek S. Borkar
Publication date: 4 October 2019
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07958
dynamic programmingHamiltonian cyclescommunication speeddifferentiation of Markov operatorsfastest Markov chains/processesspectra of Markov operators
Dynamic programming (90C39) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27) Stochastic matrices (15B51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On transition matrices of Markov chains corresponding to Hamiltonian cycles
- Eigentime identity for asymmetric finite Markov chains
- Hamiltonian cycle problem and Markov chains.
- Consistent behavior of certain perturbed determinants induced by graphs
- Perturbation theory for linear operators.
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- Markov chains, Hamiltonian cycles and volumes of convex bodies
- Hamiltonian cycle curves in the space of discounted occupational measures
- Mixing times with applications to perturbed Markov chains
- Constrained Discounted Markov Decision Processes and Hamiltonian Cycles
- On the Hamiltonicity Gap and doubly stochastic matrices
- Proof of the Hamiltonicity-Trace Conjecture for Singularly Perturbed Markov Chains
- Markov Chains and Optimality of the Hamiltonian Cycle
- Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem
- A Dynamic Programming Approach to Sequencing Problems
- Determinants and Longest Cycles of Graphs
- Mathematical Aspects of Mixing Times in Markov Chains
- An Analysis of Stochastic Shortest Path Problems
- Hamiltonian Cycles and Markov Chains
- Hamiltonian Cycles and Subsets of Discounted Occupational Measures
- Controlled Markov Chains, Graphs, and Hamiltonicity
- Cycle Representations of Markov Processes
