Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Topics in the Constructive Theory of Countable Markov Chains

Topics in the Constructive Theory of Countable Markov Chains

Topics in the Constructive Theory of Countable Markov Chains

Authors:
G. Fayolle, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
V. A. Malyshev, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
M. V. Menshikov, Moscow State University
Published:
June 2008
Availability:
Available
Format:
Paperback
ISBN:
9780521064477

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

$55.00
USD
Paperback
$148.00 USD
Hardback

    Markov chains are an important idea, related to random walks, which crops up widely in applied stochastic analysis. They are used, for example, in performance modelling and evaluation of computer networks, queuing networks, and telecommunication systems. The main point of the present book is to provide methods, based on the construction of Lyapunov functions, of determining when a Markov chain is ergodic, null recurrent, or transient. These methods can also be extended to the study of questions of stability. Of particular concern are reflected random walks and reflected Brownian motion. The authors provide not only a self-contained introduction to the theory but also details of how the required Lyapunov functions are constructed in various situations.

    • Original research, first time of publication
    • Lots of interest in subject matter
    • Of interest to researchers in applied mathematics, statistics, probability

    Reviews & endorsements

    "...collects together, for the first time, a number of important results and techniques for countable Markov chains....The writing is clear and concise....an important and valuable addition." Kyle Siegrist, Mathematical Reviews

    See more reviews

    Product details

    May 1995
    Hardback
    9780521461979
    176 pages
    235 × 156 × 15 mm
    0.364kg
    17 b/w illus.
    Available

    Table of Contents

    • 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.
      Authors
    • G. Fayolle , Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
    • V. A. Malyshev , Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
    • M. V. Menshikov , Moscow State University