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 have 20 years experience selling books worldwide! Friendly customer support. Your satisfaction guaranteed!

Visit Seller's Storefront

Seller's business information

Miramar International Services LLC

Sale & Shipping Terms

Terms of Sale

www.californiabooks.com

Shipping Terms

www.californiabooks.com

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	3 to 7 business days	2 to 5 business days
First item	US$ 0.00	US$ 12.00

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.