Markov random field
Builds on Graphical modelGraphConditional independenceRandom variable
Definition
Let be a finite undirected graph and let be random variables. For write . A set separates from if every path from a vertex of to a vertex of passes through . Then is a Markov random field with respect to if it has the global Markov property. This means: whenever are disjoint and separates from , and are conditionally independent given .
Remarks
Two weaker properties are also used. In the local Markov property, each is conditionally independent of all non-neighbours given its neighbours . In the pairwise Markov property, for all non-adjacent . Global implies local implies pairwise, and all three are equivalent when the joint density is strictly positive. Example: on the path , a Markov chain is a Markov random field, since separates from and . Non-example: let be independent fair coins and . Then and are dependent given , so is not a Markov random field on this path.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Conditional independence concept
- Graph concept
- Graphical model concept
- Random variable concept
- Markov random field definition
Further reading
About this page
| Tag | 4JX3WDYJ83 |
|---|---|
| URI | m2://4JX3WDYJ83 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 62H22, 60G60 |
| Defines | Markov random field |
| Uses | Graphical model, Graph, Conditional independence, Random variable |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.