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 modeling 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, which are on the whole original and new, can also be extended to the study of questions of stability. Of particular concern are reflected random walks and reflected Brownian motion. Here, the authors provide a self-contained introduction to the theory and details of how the required Lyapunov functions are constructed in various situations.

About the Author

Rocquencourt

"About this title" may belong to another edition of this title.

Store Description

We carry a wide selection of books from South Asia, United States, UK.

Visit Seller's Storefront

Seller's business information

Readingos GmbH
Kaiserstra�e 47, Frankfurt am Main, 60329, Germany

Sale & Shipping Terms

Terms of Sale

Shipping Terms

To ensure faster delivery, books may be shipped from any of the following locations Germany, the United Kingdom (UK), the United States (US), based on the buyer's address and product availability.

Shipping rates from Germany to U.S.A.

Shipping rates from Germany to U.S.A.
Order quantity	25 to 45 business days	8 to 14 business days
First item	US$ 11.74	US$ 22.07

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.