Markov Random Field - Understanding the Definition

Click For Summary

Discussion Overview

The discussion revolves around understanding the definition of a Markov random field, particularly focusing on the domain and range of the random element X as described in a mathematical context. Participants explore the implications of the definition in relation to the graph structure and the nature of the random variables involved.

Discussion Character

  • Technical explanation
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • One participant seeks clarification on the domain of the random element X, questioning the phrase "A random element X taking values in..." and expressing confusion about its range and domain.
  • Another participant suggests that the domain of X is W, providing an example with specific values for X.
  • A different participant argues that they only have V and S, leading to a discussion about whether X should be defined as a function from V to S^V.
  • One participant acknowledges that W is a subset of V and asserts that the domain of X is V.
  • Another participant expresses skepticism about this assertion, questioning the representation of V as locations rather than outcomes and inquiring about the probability measure on V.
  • A later reply clarifies the distinction between a vector of random variables and a set of random variables, explaining how each vertex in V corresponds to an element of X and discussing the implications for the domain and selection process.
  • The same participant introduces a more complete notation for the relationship between X and the sample space, suggesting that the selection process could be folded into the sample space notation.

Areas of Agreement / Disagreement

Participants express differing views on the domain of the random element X, with some asserting it is V while others question this interpretation. The discussion remains unresolved as participants explore various interpretations and implications without reaching consensus.

Contextual Notes

There are limitations in the discussion regarding the assumptions about the nature of the random variables and the representation of the graph. The relationship between the vertices and the outcomes in the context of the Markov random field is not fully clarified, leading to ongoing questions about the definitions used.

Palindrom
Messages
263
Reaction score
0
First encounter with the term, I'd like some help understanding it. I know there are several approaches, but this one is important to me because I'm trying to understand an article that uses it throughout its text.

Definition: Let G=(V,E) be a finite (connected) graph and let S be a finite set. A random element X taking values in S^V is said to be a Markov random field if for each W\subset V, the conditional distribution of X(W) given X(V\W) depends on X(V\W) only through its values on \partial W.

It goes on to write this mathematically, which I will write down here if you ask me to. My problem is with the phrase "A random element X taking values in...".
I just want to know from where to where X is. Obviously X takes values in S^V, so this is the range of X. What is its domain?
 
Physics news on Phys.org
Obviously X's domain is W. E.g. X(w) = 1 if w = Head, X(w) = 0 if w = Tail. Then W = {Head, Tail).
 
I don't have W, I have only V and S.

Did you mean V? So X:V\rightarrow S^V?

I don't see the sense of that - V doesn't represent states, it is the vertices's set of the graph.

Could you explain?
 
You are right, W is a subset of V; so the domain is V.
 
I can't see why. Needless to say I believe you, but I don't understand it.

You're telling me that X:V\rightarrow S^V? I can't see why, V represents locations, not outcomes in some experiment. I mean, are we assigning to each atom a configuration of the whole system?

Besides, what is the probability measure on V?
 
Last edited:
I should have differentiated between a vector X of random variables and a set X of random variables. From your definition, X is a set of random variables. Each vertex v of V represents an element of X.

In the 2-D Isling model, (V,E) looks like:
?
?
?
?
where each ? is a vertex v with two possible values (+,-) and 4 neighbors (North, East, South, West), unless it is sitting on the boundary.

Had X been defined as a vector, the domain of X would have been the sample space \Omega which underlies the joint probability P(X = x).

But for a subset U of V, X(U) denotes the image of "those vertices that are included in U." (When X is a set, there is an implicit selection process w/r/t which vertices to include in the set.)

Although the v's in V have the joint domain \Omega, the domain of the set X is defined as V. This emphasizes the selection process. At least that's how I understand it.

A more complete notation would be to write \bold X(V(\Omega_V)) = SV. Although with some misuse of notation one might write \Omega_V for V. This would fold the selection process into the sample space.

A free e-book can be found at: http://www.ams.org/online_bks/conm1/
 
Last edited:

Similar threads

  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K