Article
Determinants and Longest Cycles of Graphs
SIAM Journal on Discrete Mathematics (Impact Factor: 0.65). 01/2008; 22(3):12151225. 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 rankone 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.

 "Theorem 1.1. ([5] "
[Show abstract] [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 12/2011; 48(2011). DOI:10.1239/jap/1324046008 · 0.59 Impact Factor 
 "However, we 12 could start at one or end up at one by chance. There are also problems (see [4]) that have a form of symmetry that results in the gradient being in the space of the eigenvectors corresponding to the positive eigenvalues of H. It is a consequence of variables whose values, when they are switched, give the same objective. "
Chapter: Newton‐Type Methods
Wiley Encyclopedia of Operations Research and Management Science, 02/2011; , ISBN: 9780470400531 
 "It was proved in [1] that if Γ is a Hamiltonian graph, the set of global maximisers for (1) is the set of P corresponding to Hamiltonian cycles in Γ, and that the objective function of (1) has optimal value V (Γ) = N . Furthermore, it was proved that if Γ is a nonHamiltonian graph, then (1) has optimal value that is strictly less than N . "
[Show abstract] [Hide abstract]
ABSTRACT: We present an unconstrained logarithmic barrier algorithm to solve the Hamiltonian cycle problem. The interior point method described here takes advantage of significant improvements in efficiency gained by the use of a special LU decomposition. Some initial results and an example are presented to illustrate the potential effectiveness of this method.01/2010; 37(3).
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.