Hamiltonian cycle problem and markov chains
Resource Information
The work Hamiltonian cycle problem and markov chains represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Hamiltonian cycle problem and markov chains
Resource Information
The work Hamiltonian cycle problem and markov chains represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
 Label
 Hamiltonian cycle problem and markov chains
 Statement of responsibility
 Vivek S. Borkar...[et al.]
 Subject

 Hamiltonian systems
 Distribution (Probability theory).
 Markov processes
 Economics/Management Science
 Probability Theory and Stochastic Processes
 Hamiltonian systems
 Affaires
 Electronic books
 Markov processes
 Economics/Management Science.
 Markov processes
 Operations Research, Management Science
 Hamiltonian systems
 Mathematical optimization.
 Hamiltonian systems
 Markov processes
 Operations Research, Management Science.
 Operations Research/Decision Theory.
 Economics.
 Hamiltonian systems
 Electronic resources
 MATHEMATICS / Differential Equations / General
 Science économique
 Markov processes
 Operations Research/Decision Theory
 Markov processes
 Optimization
 Probability Theory and Stochastic Processes.
 Optimization.
 Hamiltonian systems
 Language
 eng
 Summary
 This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research  such as the Hamiltonian cycle and the Travelling Salesman problems – into convex domains where continuum analysis can be carried out. Arguably, the inherent difficulty of these, now classical, problems stems precisely from the discrete nature of domains in which these problems are posed. The convexification of domains underpinning the reported results is achieved by assigning probabilistic interpretation to key elements of the original deterministic problems. In particular, approaches summarized here build on a technique that embeds Hamiltonian Cycle and Traveling Salesman problems in a structured singularly perturbed Markov decision process. The unifying idea is to interpret subgraphs traced out by deterministic policies (including Hamiltonian cycles, if any) as extreme points of a convex polyhedron in a space filled with randomized policies. The above, innovative, approach has now evolved to the point where there are many, both theoretical and algorithmic, results that exploit the nexus between graph theoretic structures and both probabilistic and algebraic entities of related Markov chains. The latter include moments of first return times, limiting frequencies of visits to nodes, or the spectra of certain matrices traditionally associated with the analysis of Markov chains. However, these results and algorithms are dispersed over more than fifteen research papers appearing in journals catering to disparate audiences such as: MOR, Random Structures and Algorithms, SIAM J. on Discrete Mathematics, Optimization, J. of Mathematical Analysis and Applications and some others. Furthermore, because of the evolution of this topic and specific orientation of these journals, the published manuscripts are often written in a very terse manner and use disparate notation. As such it is difficult for new researchers to make use of the many advances reported in these papers. Hence the main purpose of this book is to present a concise and yet, well written, synthesis of the majority of the theoretical and algorithmic results obtained so far. In addition the book will discuss numerous open questions and problems that arise from this body of work and which are yet to be fully solved. The authors believe that their approach casts the Hamiltonian Cycle and Traveling Salesman problems in a mathematical framework that permits analytical concepts and techniques, not used hitherto in their context, to be brought to bear to further clarify both the underlying difficulty of NPcompleteness of these problems and the relative exceptionality of truly difficult instances. Finally, the material is arranged in such a manner that the introductory chapters require very little mathematical background and discuss instances of graphs with interesting structures that motivated a lot of the research in this topic. More difficult results are introduced later but, unlike the research manuscripts where they were originally proved, are illustrated with numerous examples
 Cataloging source
 GW5XE
 Image bit depth
 0
 LC call number
 QA614.83
 LC item number
 .H36 2012
 Literary form
 non fiction
 Nature of contents
 dictionaries
 Series statement
 International Series in Operations Research & Management Science,
 Series volume
 171
Context
Context of Hamiltonian cycle problem and markov chainsEmbed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/mqjYK5VU7Lk/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/mqjYK5VU7Lk/">Hamiltonian cycle problem and markov chains</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Work Hamiltonian cycle problem and markov chains
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/mqjYK5VU7Lk/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/mqjYK5VU7Lk/">Hamiltonian cycle problem and markov chains</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>