 |
|
|
Item Details
| Title:
|
TOPICS IN THE CONSTRUCTIVE THEORY OF COUNTABLE MARKOV CHAINS
|
| By: |
G. Fayolle, V. A. Malyshev, M. V. Menshikov |
| Format: |
Hardback |
| List price:
|
£110.00 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
0521461979 |
| ISBN 13: |
9780521461979 |
| Publisher: |
CAMBRIDGE UNIVERSITY PRESS |
| Pub. date: |
18 May, 1995 |
| Pages: |
176 |
| Description: |
Provides methods of analysing Markov chains based on Lyapunov functions. |
| Synopsis: |
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. |
| Illustrations: |
17 b/w illus. |
| Publication: |
UK |
| Imprint: |
Cambridge University Press |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.
|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...
|
|
|
|
|