Results 1 to 1 of 1

Thread: I and D-Maps of independence relations

  1. #1
    Junior Member
    Jul 2011

    I and D-Maps of independence relations

    By defintion the (closed) graph G= (V, V x V) over a set of statistical variabeles is an I-map for any independence relation over V.
    I find this counter intuitive, take for example the Independence relation over V defined by the statements I(\{V_1\}, \{V_2, V_3\}, \{V_4\}) and I(\{V_2\}, \{V_1, V_4\}, \{V_3\}). This tells me V1 and V4 are independent given V2 & V3 and that V2 is independent of V3 given V1 and V4. This would correspond to the following separation statements: <\{V_1\} | \{V_2, V_3\} | \{V_4\}>_G and <\{V_2\} | \{V_1, V_4\} | \{V_3\}>_G.

    But in the completed graph there's an edge from V1 to V4 and from V2 to V3. And so basically there exist 4 I-Maps for this indepence relation, the combinations 'between' the closed graph (V, VxV) and the graph in which there is no edge from V1 to V4 and V2 to V3.
    In my opinion this does not correspond to the separation/independence statements. So clearly my intuition is lacking. Could anyone give some more clarification on this?

    And as a sidemark, is anyone aware of some nice (online) tool to draw graphs?
    Last edited by Lepzed; September 30th 2012 at 07:16 AM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Relations and Functions - Inverse Relations Question
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 13th 2011, 12:20 PM
  2. Replies: 1
    Last Post: September 19th 2011, 01:09 PM
  3. Replies: 0
    Last Post: November 15th 2010, 01:24 PM
  4. how many injective maps?
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 28th 2010, 07:44 AM
  5. Maps
    Posted in the Geometry Forum
    Replies: 2
    Last Post: November 1st 2008, 07:29 PM

Search Tags

/mathhelpforum @mathhelpforum