Article

# Determinants and Longest Cycles of Graphs.

• ##### Giang T. Nguyen
SIAM J. Discrete Math 01/2008; 22:1215-1225. DOI: 10.1137/070693898
Source: DBLP

ABSTRACT We consider the Hamiltonian cycle problem on a given graph G. With such a graph we can associate a family ℱ of probability transition matrices of Markov chains whose entries represent the probabilities of traversing corresponding arcs of the graph. When the underlying graph is Hamiltonian, we show the transition probability matrix induced by a Hamiltonian cycle maximizes — over ℱ — the determinant of a matrix that is a rank-one correction of the generator matrix of a Markov chain. In the case when the graph does not possess a Hamiltonian cycle, the above maximization yields a transition matrix of a chain with a longest simple cycle (in G) comprising that chain’s unique ergodic class. These problems also have analogous eigenvalue interpretations.

0 Bookmarks
·
47 Views
• Source
##### Article: Proof of the Hamiltonicity-trace conjecture for singularly perturbed Markov chains
[Hide abstract]
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.
Journal of Applied Probability 01/2011; 48(2011). · 0.55 Impact Factor
• ##### Article: A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem.
[Hide abstract]
ABSTRACT: In this paper, we propose a new hybrid algorithm for the Hamiltonian cycle problem by synthesizing the Cross Entropy method and Markov decision processes. In particular, this new algorithm assigns a random length to each arc and alters the Hamiltonian cycle problem to the travelling salesman problem. Thus, there is now a probability corresponding to each arc that denotes the probability of the event “this arc is located on the shortest tour.” Those probabilities are then updated as in cross entropy method and used to set a suitable linear programming model. If the solution of the latter yields any tour, the graph is Hamiltonian. Numerical results reveal that when the size of graph is small, say less than 50 nodes, there is a high chance the algorithm will be terminated in its cross entropy component by simply generating a Hamiltonian cycle, randomly. However, for larger graphs, in most of the tests the algorithm terminated in its optimization component (by solving the proposed linear program).
Annals of Operations Research 01/2011; 189:103-125. · 1.03 Impact Factor
• ##### Article: On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph
[Hide abstract]
ABSTRACT: We present an algorithm to find the determinant and its first and second derivatives of a rank-one corrected generator matrix of a doubly stochastic Markov chain. The motivation arises from the fact that the global minimiser of this determinant solves the Hamiltonian cycle problem. It is essential for algorithms that find global minimisers to evaluate both first and second derivatives at every iteration. Potentially the computation of these derivatives could require an overwhelming amount of work since for the Hessian N 2 cofactors are required. We show how the doubly stochastic structure and the properties of the objective may be exploited to calculate all cofactors from a single LU decomposition.
Journal of Global Optimization 08/2013; 56(4). · 1.31 Impact Factor