Name
Abstract | ||
|---|---|---|
In this paper, we present some algebraic properties of a particular class of probability transition matrices, namely, Hamiltonian transition matrices. Each matrix in this class corresponds to a Hamiltonian cycle in a given graph on 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 powers of , 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. |
Year | DOI | Venue |
|---|---|---|
2016 | https://doi.org/10.1007/s10479-014-1642-2 | Annals of Operations Research |
Keywords | Field | DocType |
Markov Chain,Undirected Graph,Markov Decision Process,Hamiltonian Cycle,Probability Transition Matrix | Discrete mathematics,Combinatorics,Mathematical optimization,Hamiltonian (quantum mechanics),Heuristic (computer science),Matrix (mathematics),Hamiltonian path,Markov chain,Markov decision process,Hitting time,Periodic graph (geometry),Mathematics | Journal |
Volume | Issue | ISSN |
243 | 1 | 0254-5330 |
Citations | PageRank | References |
1 | 0.37 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Konstantin Avrachenkov | 1 | 1250 | 126.17 |
| Ali Eshragh | 2 | 15 | 3.12 |
| Jerzy A. Filar | 3 | 120 | 23.36 |