On transition matrices of Markov chains corresponding to Hamiltonian cycles

Abstract : In this paper, 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. As an illustration of these analytical results, we exploit them to develop a new heuristic algorithm to determine a non-Hamiltonicity of a given graph.
Type de document :
Article dans une revue
Liste complète des métadonnées

Contributeur : Konstantin Avrachenkov <>
Soumis le : lundi 8 décembre 2014 - 15:46:16
Dernière modification le : samedi 27 janvier 2018 - 01:31:42

Lien texte intégral




Konstantin Avrachenkov, Ali Eshragh, Jerzy A. Filar. On transition matrices of Markov chains corresponding to Hamiltonian cycles. Annals of Operations Research, Springer Verlag, 2014, pp.17. 〈http://link.springer.com/article/10.1007/s10479-014-1642-2〉. 〈10.1007/s10479-014-1642-2〉. 〈hal-01092355〉



Consultations de la notice