Article contents
Proof of the Hamiltonicity-Trace Conjecture for Singularly Perturbed Markov Chains
Published online by Cambridge University Press: 14 July 2016
Abstract
We prove the conjecture formulated in Litvak and Ejov (2009), namely, that the trace of the fundamental matrix of a singularly perturbed Markov chain that corresponds to a stochastic policy feasible for a given graph is minimised at policies corresponding to Hamiltonian cycles.
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 2011
References
- 1
- Cited by