Proof of the Hamiltonicity-Trace Conjecture for Singularly Perturbed Markov Chains-Reference-Cited by-同舟云学术

Proof of the Hamiltonicity-Trace Conjecture for Singularly Perturbed Markov Chains

Published:2011-12 Issue:04 Volume:48 Page:901-910
ISSN:0021-9002
Container-title:Journal of Applied Probability
language:en
Short-container-title:J. Appl. Probab.

Author:

Ejov Vladimir,Litvak Nelly,Nguyen Giang T.,Taylor Peter G.

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.

Publisher

Cambridge University Press (CUP)

Subject

Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability

Reference16 articles.

1. Determinants and Longest Cycles of Graphs

2. Hamiltonian Cycles and Markov Chains

3. Hamiltonian Cycles and Singularly Perturbed Markov Chains

4. An Interior Point Heuristic for the Hamiltonian Cycle Problem via Markov Decision Processes

5. Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Buck-Passing Game;Mathematics of Operations Research;2021-11-08

2. Feasible Bases for a Polytope Related to the Hamilton Cycle Problem;Mathematics of Operations Research;2021-11

3. Hamiltonian Cycles and Subsets of Discounted Occupational Measures;Mathematics of Operations Research;2020-05

4. On the fastest finite Markov processes;Journal of Mathematical Analysis and Applications;2020-01