Abstract
One means of generalizing denumerable stochastic processes {x n } with time parameter set ℕ = {0, 1, ... } is to consider random fields {x t }, where t takes on values in an arbitrary countable parameter set T. Roughly, a random field with denumerable state space S is described by a probability measure μ on the space Ω = ST of all configurations of values from S on the generalized time set T. In this chapter we discuss certain extensions of Markov chains, called Markov fields which have been important objects of study in the recent development of probability theory. Only some of the highlights of this rich theory will be covered; we concentrate especially on the case T = ℤ = the integers, where the connections with classical Markov chain theory are deepest.
Keywords
- Markov Chain
- Markov Process
- Random Field
- Transition Matrix
- Neighbor System
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1976 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Griffeath, D. (1976). Introduction to Random Fields. In: Denumerable Markov Chains. Graduate Texts in Mathematics, vol 40. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9455-6_12
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9455-6_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-9457-0
Online ISBN: 978-1-4684-9455-6
eBook Packages: Springer Book Archive