Hamiltonian transition matrices

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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. Copyright © 2011 ICST.

Cite

CITATION STYLE

APA

Avrachenkov, K., Eshragh, A., & Filar, J. A. (2011). Hamiltonian transition matrices. In VALUETOOLS 2011 - 5th International ICST Conference on Performance Evaluation Methodologies and Tools (pp. 463–466). ICST. https://doi.org/10.4108/icst.valuetools.2011.245841

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free