Hamiltonian cycles and Markov chains
Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Controlled Markov chains, graphs, and Hamiltonicity
Foundations and Trends® in Stochastic Systems
On the Hamiltonicity Gap and doubly stochastic matrices
Random Structures & Algorithms
Hi-index | 0.00 |
In this pedagogical note, we present some algebraic properties of a particular class of probability transition matrices, namely, Hamiltonian transition matrices. Each matrix P in this class corresponds to a Hamiltonian cycle in a given graph G on n nodes and to an irreducible, periodic, Markov chain. We show that a number of important matrices traditionally associated with Markov chains, namely, the stationary, fundamental, deviation and the hitting time matrix all have elegant expansions in the first n − 1 powers of P, whose coefficients can be explicitly derived. We also consider the resolvent-like matrices associated with any given Hamiltonian cycle and its reverse cycle and prove an identity about the product of these matrices.