Doubly Stochastic Matrices & The Hamiltonian Cycle Problem

点击翻译按钮获取中文摘要

The classical hard problem of determining whether a given graph possesses a Hamiltonian cycle contains the essential difficulty of the famous 'Travelling Salesman Problem'. A characterisation of this difficulty in terms of variability of returns (to the initial state) in a controlled stochastic process will be a significant conceptual advance with repercussions in a number of fields including optimisation and theoretical computer science. Algorithmic advances exploiting such a characterisation will significantly contribute to existing technologies for solving problems in applications ranging from logistics to cryptography. Since TSP describes certain efficient ways of routing its applicability to information networks is clear.