Other available formats:
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 firstname.lastname@example.org providing details of the course you are teaching.
The purpose of this book is to present the theory of general irreducible Markov chains and to point out the connection between this and the Perron-Frobenius theory of nonnegative operators. The author begins by providing some basic material designed to make the book self-contained, yet his principal aim throughout is to emphasize recent developments. The technique of embedded renewal processes, common in the study of discrete Markov chains, plays a particularly important role. The examples discussed indicate applications to such topics as queueing theory, storage theory, autoregressive processes and renewal theory. The book will therefore be useful to researchers in the theory and applications of Markov chains. It could also be used as a graduate-level textbook for courses on Markov chains or aspects of operator theory.Read more
- Includes recent developments
- Can be used as a graduate-level textbook
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: June 2004
- format: Paperback
- isbn: 9780521604949
- length: 172 pages
- dimensions: 215 x 137 x 11 mm
- weight: 0.27kg
- availability: Available
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×