About: Matrix analytic method is a research topic. Over the lifetime, 515 publications have been published within this topic receiving 12856 citations.
TL;DR: In this paper, a mathematical text suitable for students of engineering and science who are at the third year undergraduate level or beyond is presented, which is a book of applicable mathematics, which avoids the approach of listing only the techniques, followed by a few examples.
Abstract: This is a mathematical text suitable for students of engineering and science who are at the third year undergraduate level or beyond. It is a book of applicable mathematics. It avoids the approach of listing only the techniques, followed by a few examples, without explaining why the techniques work. Thus, it provides not only the know-how but also the know-why. Equally, the text has not been written as a book of pure mathematics with a list of theorems followed by their proofs. The authors' aim is to help students develop an understanding of mathematics and its applications. They have refrained from using clichés like “it is obvious” and “it can be shown”, which may be true only to a mature mathematician. On the whole, the authors have been generous in writing down all the steps in solving the example problems.The book comprises ten chapters. Each chapter contains several solved problems clarifying the introduced concepts. Some of the examples are taken from the recent literature and serve to illustrate the applications in various fields of engineering and science. At the end of each chapter, there are assignment problems with two levels of difficulty. A list of references is provided at the end of the book.This book is the product of a close collaboration between two mathematicians and an engineer. The engineer has been helpful in pinpointing the problems which engineering students encounter in books written by mathematicians.
TL;DR: In this article, the second largest eigenvalue and spectral gap of a reversible Markov chain were derived for the random walk associated to approximate computation of the permanent. But these bounds depend on geometric quantities such as the maximum degree, diameter and covering number of associated graphs.
Abstract: We develop bounds for the second largest eigenvalue and spectral gap of a reversible Markov chain. The bounds depend on geometric quantities such as the maximum degree, diameter and covering number of associated graphs. The bounds compare well with exact answers for a variety of simple chains and seem better than bounds derived through Cheeger-like inequalities. They offer improved rates of convergence for the random walk associated to approximate computation of the permanent.
TL;DR: In this paper, the authors present a history of ergodic Markov chains, including the explicit construction of Lyapunov functions and random walks in two-dimensional complexes.
Abstract: Introduction and history 1. Preliminaries 2. General criteria 3. Explicit construction of Lyapunov functions 4. Ideology of induced chains 5. Random walks in two dimensional complexes 6. Stability 7. Exponential convergence and analyticity for ergodic Markov chains Bibliography.
TL;DR: In this paper, a stable recursive scheme was proposed to compute the steady state probability vector for the M/G/1 case. But this scheme is not applicable to the Gauss-Seidel iterative scheme.
Abstract: For the matrix analogues of Markov chains of the M/G/1 type, we derive a stable recursive scheme to compute the steady state probability vector. This scheme, which is the natural generalization of a clever device attributed to P.J. Burke in the M/G/1 case, is substantially superior to the Gauss-Seidel iterative scheme.