Denumerable Markov Chains - with a chapter of Markov Random Fields by David Griffeath (Hardcover, 2nd ed. 1976)

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."

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Graduate Texts in Mathematics, 40
Release date:	September 1976
First published:	1976
Authors:	John G. Kemeny
Assisted by:	D.S. Griffeath
Authors:	J.Laurie Snell • Anthony W. Knapp
Dimensions:	234 x 156 x 26mm (L x W x T)
Format:	Hardcover
Pages:	484
Edition:	2nd ed. 1976
ISBN-13:	978-0-387-90177-0
Categories:	Books > Science & Mathematics > Mathematics > Probability & statistics Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Vector & tensor analysis Promotions
LSN:	0-387-90177-9
Barcode:	9780387901770

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!