𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Denumerable Markov Chains: with a chapter of Markov Random Fields by David Griffeath

✍ Scribed by John G. Kemeny, J. Laurie Snell, Anthony W. Knapp (auth.)


Publisher
Springer-Verlag New York
Year
1976
Tongue
English
Leaves
495
Series
Graduate Texts in Mathematics 40
Edition
2
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


With the first edition out of print, we decided to arrange for republiΒ­ cation of Denumerrible Markov Ohains with additional bibliographic material. The new edition contains a section Additional Notes that indicates some of the developments in Markov chain theory over the last ten years. As in the first edition and for the same reasons, we have resisted the temptation to follow the theory in directions that deal with uncountable state spaces or continuous time. A section entitled Additional References complements the Additional Notes. J. W. Pitman pointed out an error in Theorem 9-53 of the first edition, which we have corrected. More detail about the correction appears in the Additional Notes. Aside from this change, we have left intact the text of the first eleven chapters. The second edition contains a twelfth chapter, written by David Griffeath, on Markov random fields. We are grateful to Ted Cox for his help in preparing this material. Notes for the chapter appear in the section Additional Notes. J.G.K., J.L.S., A.W.K.

✦ Table of Contents


Front Matter....Pages i-xii
Prerequisites From Analysis....Pages 1-39
Stochastic Processes....Pages 40-57
Martingales....Pages 58-78
Properties of Markov Chains....Pages 79-105
Transient Chains....Pages 106-129
Recurrent Chains....Pages 130-165
Introduction to Potential Theory....Pages 166-190
Transient Potential Theory....Pages 191-240
Recurrent Potential Theory....Pages 241-322
Transient Boundary Theory....Pages 323-400
Recurrent Boundary Theory....Pages 401-424
Introduction to Random Fields....Pages 425-458
Back Matter....Pages 459-484

✦ Subjects


Analysis


πŸ“œ SIMILAR VOLUMES


Denumerable Markov chains
✍ John G. Kemeny, J. Laurie Snell, Anthony W. Knapp, D.S. Griffeath πŸ“‚ Library πŸ“… 1976 πŸ› Springer 🌐 English

This textbook provides a systematic treatment of denumerable Markov chains, covering both the foundations of the subject and some in topics in potential theory and boundary theory. It is a discussion of relations among what might be called the descriptive quantities associated with Markov chains-pro

Denumerable Markov Chains
✍ John G. Kemeny, J. Laurie Snell, Anthony W. Knapp πŸ“‚ Library πŸ“… 1976 πŸ› Springer 🌐 English
Denumerable Markov Chains
✍ Wolfgang Woess πŸ“‚ Library πŸ“… 2009 πŸ› European Mathematical Society 🌐 English

Markov chains are among the basic and most important examples of random processes. This book is about time-homogeneous Markov chains that evolve with discrete time steps on a countable state space. A specific feature is the systematic use, on a relatively elementary level, of generating functions as

Markov Random Fields
✍ Yu. A. Rozanov (auth.) πŸ“‚ Library πŸ“… 1982 πŸ› Springer-Verlag New York 🌐 English

<p>In this book we study Markov random functions of several variables. What is traditionally meant by the Markov property for a random process (a random function of one time variable) is connected to the concept of the phase state of the process and refers to the independence of the behavior of the

Markov Random Fields
✍ Yu. A. Rozanov (auth.) πŸ“‚ Library πŸ“… 1982 πŸ› Springer-Verlag New York 🌐 English

<p>In this book we study Markov random functions of several variables. What is traditionally meant by the Markov property for a random process (a random function of one time variable) is connected to the concept of the phase state of the process and refers to the independence of the behavior of the

Denumerable Markov chains: Generating fu
✍ Woess W. πŸ“‚ Library πŸ“… 2009 πŸ› EMS 🌐 English

Markov chains are among the basic and most important examples of random processes. This book is about time-homogeneous Markov chains that evolve with discrete time steps on a countable state space. A specific feature is the systematic use, on a relatively elementary level, of generating functions as