Vladimir Ejov's Books

Hamiltonian Cycle Problem and Markov Chains

By: Vivek S. Borkar,Vladimir Ejov,Jerzy A. Filar,Giang T. Nguyen

Write a review Read reviews Take a Quiz Solve Book Puzzle

Hamiltonian Cycle Problem and Markov Chains

By: Vivek S. Borkar,Vladimir Ejov,Jerzy A. Filar,Giang T. Nguyen

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 these results is achieved by assigning probabilistic interpretation to key elements of the original deterministic problems. In particular, the approaches summarized here build on a technique that embeds Hamiltonian Cycle and Travelling 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 many research papers appearing in journals catering to disparate audiences. As a result, the published manuscripts are often written in a very terse manner and use disparate notation, thereby making it difficult for new researchers to make use of the many reported advances. Hence the main purpose of this book is to present a concise and yet easily accessible synthesis of the majority of the theoretical and algorithmic results obtained so far. In addition, the book discusses numerous open questions and problems that arise from this body of work and which are yet to be fully solved. The approach casts the Hamiltonian Cycle Problem in a mathematical framework that permits analytical concepts and techniques, not used hitherto in this context, to be brought to bear to further clarify both the underlying difficulty of NP-completeness of this problem 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 and are illustrated with numerous examples.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

205

Publisher

Springer Science & Business Media

Published Date

ISBN 10

1461432324

ISBN 13

9781461432326

Genetic Theory for Cubic Graphs

By: Pouya Baniasadi,Vladimir Ejov,Jerzy A. Filar,Michael Haythorpe

Write a review Read reviews Take a Quiz Solve Book Puzzle

Genetic Theory for Cubic Graphs

By: Pouya Baniasadi,Vladimir Ejov,Jerzy A. Filar,Michael Haythorpe

This book was motivated by the notion that some of the underlying difficulty in challenging instances of graph-based problems (e.g., the Traveling Salesman Problem) may be “inherited” from simpler graphs which – in an appropriate sense – could be seen as “ancestors” of the given graph instance. The authors propose a partitioning of the set of unlabeled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants dominates that of the genes. The key distinction between the two subsets is the presence of special edge cut sets, called cubic crackers, in the descendants. The book begins by proving that any given descendant may be constructed by starting from a finite set of genes and introducing the required cubic crackers through the use of six special operations, called breeding operations. It shows that each breeding operation is invertible, and these inverse operations are examined. It is therefore possible, for any given descendant, to identify a family of genes that could be used to generate the descendant. The authors refer to such a family of genes as a “complete family of ancestor genes” for that particular descendant. The book proves the fundamental, although quite unexpected, result that any given descendant has exactly one complete family of ancestor genes. This result indicates that the particular combination of breeding operations used strikes the right balance between ensuring that every descendant may be constructed while permitting only one generating set. The result that any descendant can be constructed from a unique set of ancestor genes indicates that most of the structure in the descendant has been, in some way, inherited from that, very special, complete family of ancestor genes, with the remaining structure induced by the breeding operations. After establishing this, the authors proceed to investigate a number of graph theoretic properties: Hamiltonicity, bipartiteness, and planarity, and prove results linking properties of the descendant to those of the ancestor genes. They develop necessary (and in some cases, sufficient) conditions for a descendant to contain a property in terms of the properties of its ancestor genes. These results motivate the development of parallelizable heuristics that first decompose a graph into ancestor genes, and then consider the genes individually. In particular, they provide such a heuristic for the Hamiltonian cycle problem. Additionally, a framework for constructing graphs with desired properties is developed, which shows how many (known) graphs that constitute counterexamples of conjectures could be easily found.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

127

Publisher

Springer

Published Date

ISBN 10

3319196804

ISBN 13

9783319196800

Hamiltonian Cycle Problem and Markov Chains

By: Vivek S. Borkar,Vladimir Ejov,Jerzy A. Filar,Giang T. Nguyen

Write a review Read reviews Take a Quiz Solve Book Puzzle

Hamiltonian Cycle Problem and Markov Chains

By: Vivek S. Borkar,Vladimir Ejov,Jerzy A. Filar,Giang T. Nguyen

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

205

Publisher

Springer Science & Business Media

Published Date

ISBN 10

1461432324

ISBN 13

9781461432326

Book's by Vladimir Ejov

Hamiltonian Cycle Problem and Markov Chains

Hamiltonian Cycle Problem and Markov Chains

Genetic Theory for Cubic Graphs

Genetic Theory for Cubic Graphs

Hamiltonian Cycle Problem and Markov Chains

Hamiltonian Cycle Problem and Markov Chains

Username

Password

Username

Password

Password again

Birthday

Email