# f11Stat946ass

## Contents

### problem 1

Recall the definition of the family of probability distributions associated with a directed graphical model:

Prove by induction that [math]p(x_i|x_{\pi_i})=f_i(x_i,x_{\pi_i})[/math].

#### solution 1

According to the product rule we have:

This is the most general case for a directed graph, as we can represent each and every graphical model with a fully connected graph.

Now, we need to show that this statement, [math]p(x_i|x_{\pi_i})=f_i(x_i,x_{\pi_i})[/math], holds for [math]n=1[/math] (and [math]n=2[/math], just for the sake of more clarity).

Where in the latter case, without loss of generality, we have assumed that [math]x_1[/math] is the only parent of [math]x_2[/math]. This assumption that we've taken, not only does not reduce from the generality of the proof (as we have initially assumed that the graph is directed and in a directed graph one of two connected nodes/random variables should be a parent of the other), but it also abides by our earlier assumption, that parents come before children. This leaves no parents for [math]x_1[/math], similar to the former case in the above.

Now, assuming that the statement [math]p(x_i|x_{\pi_i})=f_i(x_i,x_{\pi_i})[/math] holds for [math]n=k[/math],

we need to show that it also holds for [math]n=k+1[/math].

On the other hand according to [math]\sharp[/math] we have:

[math]\begin{align} p(x_1,\ldots,x_{k+1})=p(x_1,\ldots,x_{k})p(x_{k+1}|x_1,\ldots,x_{k}) \end{align}[/math]

Thus,

Once more using [math]\flat[/math], we have:

and so:

### problem 2

For a given variable [math]X_i[/math] in a graphical model, what is the minimal set of nodes that renders [math]X_i[/math] conditionally independent of all of the other variables? That is, what is the smallest set [math]C[/math], such that [math]X_i\perp X_{V\setminus \{i\}\cup C}|X_C[/math]? (Note that [math]V[/math] is the set of all nodes in the graph, so that [math]V\setminus \{i\}\cup C[/math] is the set of all nodes in the graph, excluding [math]C[/math] and [math]i[/math]).

- Do the problem for an undirected graph.
- Do the problem for a directed graph.

#### solution 1

**a.** As in directed graphs, the relationship between each two nodes, [math]X_i[/math] and [math]X_j[/math], can be of one of the child-parent or parent-child forms. Let's assume that we show the set of parents of the node [math]X_i[/math] like this: [math]X_{\pi_i}[/math]. So, a general node can be thought of as in Fig. 1. In this figure, all the possible relationships for the node [math]X_4[/math] and its immediate neighbours and those of the depth one has been shown.

From the graph in the figure we have:

So, we can derive:

Also we have:

So, by induction we can say that given the parents of a node, it will be conditionally independent of all of the nodes that come before. It is assumed that parents always come before children.

Now, if we check the independence of the nodes, from those there is a path to [math]X_4[/math] -in general- but not through parents of [math]X_4[/math], we will have:

And if the children of [math]X_4[/math] are not given, we will have:

So, as of the set [math]C[/math], we can state:

**b.** As of an undirected graph, we will have:

### problem 3

Consider the directed graphical model below.

(a) Moralize the graph, and show the resulting undirected graphical model.

(b) Invoke UndirectedGraphEliminate on your moral graph, using the elimination ordering (7, 8, 9, 6, 3, 5, 4, 2, 1), and show the resulting reconstituted graph (the graph that includes all the edges added during the elimination process). You do not have to show the intermediate steps of the algorithm.

(c) Report (b), but using the elimination ordering (7, 6, 8, 9, 4, 3, 2, 5, 1).

(d) Which of the two elimination orderings, if used in Eliminate to calculate [math]p(x_1|x_7)[/math], do you think would result in a more time-efficient calculation? Which would result in a more space-efficient calculation? Briefly explain why.

#### solution 1

**(a)** Here is the resulting moralized undirected graph (Fig. 3).

**(b)** Here is the resulting reconstituted graph, after a (7, 8, 9, 6, 3, 5, 4, 2, 1) order elimination. (Fig. 4)

**(c)** Here is the resulting reconstituted graph, after a (7, 6, 8, 9, 4, 3, 2, 5, 1) order elimination. (Fig. 5)

**(d)** It is more computationally efficient to remove those nodes, which have less number of edges, as it takes less number of summations over their neighbours. So, starting with single-edge nodes would be a good idea, which makes the first ordering more computationally efficient. (**What does space-efficient means, though?**)

### problem 4

Consider an undirected tree. We know that it is not possible in genereal to parameterize a distribution on a tree using marginal probabilities as the potentials. It is, however, possible to parameterize such a distribution using ratios of marginal probabilities. In particular let:

where [math]i[/math] and [math]j[/math] are neighbors in the tree, where [math]p(x_i)[/math] and [math]p(x_i,x_j)[/math] are a consistent set of marginal probabilities. Show that this setting of potential yields a parameterization of a joint probability distribution on the tree under which [math]p(x_i)[/math] and [math]p(x_i,x_j)[/math] are marginals. What is [math]Z[/math] under this parameterization?

#### solution 1

Based on the definition of probability function which has to satisfy the following:

one can prove that the proposed potential function, [math]\psi[/math], is non-negative and is real-valued. These two are all we need for a potential function and besides these, it can be defined totally arbitrarily, while it meets the independence characteristics of the random variables.

According to the given potential function and the definition of [math]p(x)[/math], probability distribution function for an undirected graphical model, here is how one can define the joint probability distribution:

where [math]C[/math] is the set of all maximal cliques in the tree and [math]i\neq j[/math].

### problem 5

In this problem we will work through the mechanics of using Eliminate for inference in a directed graphical model. Consider the directed graphical model below over the binary variables [math]X_1,X_2,X_3,[/math] and [math]X_4[/math].

Let [math]p(X_1=0)=p(X_1=1)=0.5[/math]. For the local conditional probabilities, [math]p(x_{i+1}|x_i)[/math], use the following matrix.

We will use eliminate to compute [math]p(X_1=0|X_4=1)[/math].

(a) Write out the summations involved in carrying out the elimination algorithm to find [math]p(x_1,x_4)[/math] and [math]p(x_4)[/math], as in Equations (3.8) and (3.15) in Chapter 3 of the text. Use the elimination ordering (4,3,2,1).

(b) Using eliminate (with [math]x_4=1[/math]), write down (as tables) the resulting intermediate terms, and [math]p(x_1,\bar{x}_4)[/math].

(c) Compute [math]p(X_1=0|X_4=1)[/math].

(d) You can alternatively do parts (a), (b), and (c) using Matlab or Splus.

#### solution 1

#### solution 2 (Code)

# Programming Language: R # In this code I tried to solve the above question using only operations over the CPT matrices # the last portion of the code shows how to use the transfer matrix method to compute # the marginal. # X41: P(X4,X1) # X4: P(X4) # Data Model transitionMatrix <- matrix(c(.6, .2, .4, .8), ncol=2, byrow=TRUE) X1 <- c(.5,.5) X21 <- transitionMatrix X32 <- transitionMatrix X43 <- transitionMatrix binaryFactorsProduct <- function(f1, f2) { # expect two factors of the form # f1: A * B, F2: B * C # where dom(A,B,C ) \in {0,1} # and return an array of the form B * (A * C) newFactor <- array(0, c(2,2,2)) newFactor[,,1] <- as.matrix(f1[,1]) %*% f2[1,] newFactor[,,2] <- as.matrix(f1[,2]) %*% f2[2,] return(newFactor) } binaryFactorsSumOut <- function(f) { #expect factor of the form B * (A * C) # return new factor return(f[,,1] + f[,,2]) } m42 <- binaryFactorsSumOut(binaryFactorsProduct(X43,X32)) m41 <- binaryFactorsSumOut(binaryFactorsProduct(m42, X21)) X41 <- m41 * X1 ######################################### # Computing the marginal p(X4) using the transfer matrix method X4 <- (X43 %*% (X32 %*% (X21 %*% X1))) #########################################

### Problem 6

For the two graphs in Figure 1, determine which variables can be reached using the Bayes ball algorithm if we start at node A.

#### Solution 1

**First graph:**
Starting from node A, the ball passes to nodes B & C. Node B blocks the ball, while node C passes the ball to nodes E & F. In turn, node E passes the ball to node G which passes the ball to nodes I & D. Node F passes the ball to node H which passes the ball to the already visited node, I. Therefore all nodes are visited.

More formally, we can say that the variables reached using the Bayes ball algorithm are:

A

B

C

E

F

G

H

D

I

**Second graph:**
Again, if we start from node A, it passes the ball to node G. As G receives the ball from a parent, it can only pass the ball to its children, hence G passes the ball to J. J is shaded, therefore it bounces the ball back to its parent G. This time G receives the ball from a child and can pass it everywhere and then the ball is passed to node D which passes the ball to nodes B & H. Node H doesn't have children and can't pass the ball anywhere, while node B passes the ball to node E which passes the ball to node I. Node I doesn't have the children and this is where the Bayes ball stops.

We can now list the variables reached using the Bayes ball algorithm in the second graph as:

A

G

J

D

B

H

E

I