Bayesian Networks, Winter 2009-2010 Yoav Haimovitch & Ariel Raviv 1.

Slides:



Advertisements
Similar presentations
Chapter 11 Trees Graphs III (Trees, MSTs) Reading: Epp Chp 11.5, 11.6.
Advertisements

6.896: Topics in Algorithmic Game Theory Lecture 21 Yang Cai.
Lecture 15. Graph Algorithms
CS 336 March 19, 2012 Tandy Warnow.
Great Theoretical Ideas in Computer Science
Great Theoretical Ideas in Computer Science for Some.
 Theorem 5.9: Let G be a simple graph with n vertices, where n>2. G has a Hamilton circuit if for any two vertices u and v of G that are not adjacent,
CS 473Lecture 131 CS473-Algorithms I Lecture 13-A Graphs.
Constraint Satisfaction Problems
1 Decomposing Hypergraphs with Hypertrees Raphael Yuster University of Haifa - Oranim.
Interval Graph Test.
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
C&O 355 Mathematical Programming Fall 2010 Lecture 22 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
Approximation, Chance and Networks Lecture Notes BISS 2005, Bertinoro March Alessandro Panconesi University La Sapienza of Rome.
Graphs III (Trees, MSTs) (Chp 11.5, 11.6)
Parallel Scheduling of Complex DAGs under Uncertainty Grzegorz Malewicz.
GOLOMB RULERS AND GRACEFUL GRAPHS
Tirgul 8 Graph algorithms: Strongly connected components.
Fast FAST By Noga Alon, Daniel Lokshtanov And Saket Saurabh Presentation by Gil Einziger.
From Variable Elimination to Junction Trees
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
Data Structures, Spring 2004 © L. Joskowicz 1 Data Structures – LECTURE 14 Strongly connected components Definition and motivation Algorithm Chapter 22.5.
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
Computational Geometry Seminar Lecture 1
A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.
Bayesian Networks Clique tree algorithm Presented by Sergey Vichik.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
Technion 1 (Yet another) decision procedure for Equality Logic Ofer Strichman and Orly Meir Technion.
Learning Equivalence Classes of Bayesian-Network Structures David M. Chickering Presented by Dmitry Zinenko.
1 Separator Theorems for Planar Graphs Presented by Shira Zucker.
Data Structures, Spring 2006 © L. Joskowicz 1 Data Structures – LECTURE 14 Strongly connected components Definition and motivation Algorithm Chapter 22.5.
MCA 520: Graph Theory Instructor Neelima Gupta
Tirgul 13 Today we’ll solve two questions from last year’s exams.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Introduction to Graph Theory
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Perfect Gaussian Elimination and Chordality By Shashank Rao.
Modular Decomposition and Interval Graphs recognition Speaker: Asaf Shapira.
Undirected Models: Markov Networks David Page, Fall 2009 CS 731: Advanced Methods in Artificial Intelligence, with Biomedical Applications.
UNC Chapel Hill Lin/Foskey/Manocha Minimum Spanning Trees Problem: Connect a set of nodes by a network of minimal total length Some applications: –Communication.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
5.2 Trees  A tree is a connected graph without any cycles.
The countable character of uncountable graphs François Laviolette Barbados 2003.
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
A Unified View of Graph Searching
Twenty Years of EPT Graphs: From Haifa to Rostock Martin Charles Golumbic Caesarea Rothschild Institute University of Haifa With thanks to my research.
1 Use graphs and not pure logic Variables represented by nodes and dependencies by edges. Common in our language: “threads of thoughts”, “lines of reasoning”,
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
Graphs Lecture 2. Graphs (1) An undirected graph is a triple (V, E, Y), where V and E are finite sets and Y:E g{X V :| X |=2}. A directed graph or digraph.
CSE 421 Algorithms Richard Anderson Winter 2009 Lecture 5.
8.4 Closures of Relations Definition: The closure of a relation R with respect to property P is the relation obtained by adding the minimum number of.
Introduction to Graph Theory
Great Theoretical Ideas in Computer Science for Some.
Today Graphical Models Representing conditional dependence graphically
Algorithms for hard problems Parameterized complexity Bounded tree width approaches Juris Viksna, 2015.
COMPSCI 102 Introduction to Discrete Mathematics.
Theory of Computational Complexity Probability and Computing Lee Minseon Iwama and Ito lab M1 1.
MCA 520: Graph Theory Instructor Neelima Gupta
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
An introduction to chordal graphs and clique trees
Computing Connected Components on Parallel Computers
What is the next line of the proof?
Planarity Testing.
A Unified View of Graph Searching
Dependency Models – abstraction of Probability distributions
Discrete Mathematics for Computer Science
Richard Anderson Lecture 5 Graph Theory
Presentation transcript:

Bayesian Networks, Winter Yoav Haimovitch & Ariel Raviv 1

 Chordal Graph  Warm up  Theorem 7  Perfect Vertex Elimination Scheme  Maximal cliques Tree Bibliography M.C.Golumbic Algorithmic Graph Theory and Perfect Graphs. Second edition Pearl, J. Probabilistic Reasoning in Intelligent Systems. 2

 Definition: Undirected graph G is chordal if every cycle of length greater than 3 has a chord.  Remark: Chordality is a hereditary property, All induced subgraphs of a chordal graph are chordal!  Chordal graphs are also called triangulated and perfect elimination graphs. 3

4

 A vertex x of G is called simplicial if its adjacency set Adj(x) is a clique (not necessarily maximal)  Lemma 1[Dirac 1961]: Each chordal graph has a simplicial vertex and if G is not a clique it has two non adjacent simplicial vertices. 5

 If G is a clique, done.  If not, assume that be has two non-adjacent nodes a and b and that the lemma is true to all graphs with fewer vertices than G. Let S be a minimal vertex separator for a and b. Let G a and G b be the connected components of a and b respectively. 6

 S is a clique – if not, then there exists x and y such that there is no edge between them, and because S is minimal vertex separator there is a cycle. It is easy to show that there exist a minimal cycle with length no less then 4 with no chords in it, contradiction. 7

 S is a clique. G A +S is smaller than G therefore by induction the lemma holds, i.e. G A +S is a clique or has two non adjacent simplicial vertices, one of each must be in G A. Any simplicial vertex in G A is a simplicial vertex in G because all elements of Adj(A) are inside G A +S. Thus from G A and G B we get two simplicial vertices in G. 8

 Definition: The following are equivalent: 1.G is chordal 2.The edges of G can be directed acyclically so that every pair of converging arrows comes from two adjacent vertices. 3.G has a perfect vertex elimination scheme. 4.There is a tree T with maximal cliques of G as vertices. Any two cliques containing v are either adjacent in T or connected by a path of cliques that contain v. 9

 By lemma 1 every chordal graph has a simplicial vertex  Direct all of its edges to it  Repeat the process with the rest of the graph (can be done because being chordal is hereditary)  From the definition of simplicial vertex corollary that each two converging edges coming from adjacent vertices. 10

 Let there be a cycle of size larger than 3.  There exist a valid direction which is acyclic  There are two converging edges, which come from two adjacent vertices  The cycle has a chord. 11

 Given a Markov network, we would like to calculate a probability function over it’s variables  What if we want to calculate the probability of one variable? 12

P(X 1,X 2,X 3,X 4,X 5 )=K∙f 1 (X 1,X 2 )f 2 (X 2,X 3 )f 3 (X 3,X 4 )f 4 (X 4,X 5 )f 5 (X 5,X 1 ) P(X 1,X 2,X 3,X 4 )=Σ X5 K∙f 1 (X 1,X 2 )f2(X 2,X 3 )f 3 (X 3,X 4 )f 4 (X 4,X 5 )f 5 (X 5,X 1 )= =K∙f 1 (X 1,X 2 )f 2 (X 2,X 3 )f 3 (X 3,X 4 ) Σ X5 f 4 (X 4,X 5 )f 5 (X 5,X 1 ) = K`∙f 1 (X 1,X 2 )f 2 (X 2,X 3 )f 3 (X 3,X 4 ) F(X 4, X 1 )  Explanation: Each time we sum over a variable we automatically add edges between all it’s adjacent vertices (creating a clique) 13

 Here is an example of how bad (i.e. big cliques) things can happen with incorrect order of summing P(X 1,X 2,X 3,X 4,X 5 )=Σ X0 K∙f 1 (X 0,X 1 )f 2 (X 0,X 2 )f 3 (X 0,X 3 )f 4 (X 0,X 4 )f 5 (X 0,X 5 ) = K`∙F(X 1,X 2,X 3,X 4,X 5 )  Explanation: For wrong order of summing we get big cliques and thus huge tables of probabilities to store, which are exponential in number of variables. 14

 Let G=(V,E) be an undirected graph and let σ=[v 1,v 2,…,v n ] be an ordering of the vertices. We say that σ is a perfect vertex elimination scheme if for each i: X i = { v j in Adj(v i ) | j>I } is complete. 15

 Definition: The following are equivalent: 1.G is chordal 2.The edges of G can be directed acyclically so that every pair of converging arrows comes from two adjacent vertices. 3.G has a perfect vertex elimination scheme. 4.There is a tree T with maximal cliques of G as vertices. Any two cliques containing v are either adjacent in T or connected by a path of cliques that contain v. 16

 By lemma 1, G has a simplicial vertex.  The subgraph induced after removing this vertex is also chordal.  By induction, there is an elimination order. 17

 Let us assume a cycle of length 4 or greater.  Let x be the first vertex on the elimination scheme of this cycle.  x is simplicial at this point.  Two vertices adjacent to x from the cycle are also adjacent between themselves. 18

3.All vertices of G can be deleted by arranging them in separate piles, one for each clique, and then repeatedly applying the following two operations:  Delete a vertex that occurs in only one pile.  Delete a pile if all its vertices appear in another pile. 19

20 A A B B C C A A C C B B D D E E B B C C D D D D E E

21 A A C C B B D D E E B B C C D D D D E E A A B B A A C C D D

 Definition: The following are equivalent: 1.G is chordal 2.The edges of G can be directed acyclically so that every pair of converging arrows comes from two adjacent vertices. 3.G has a perfect vertex elimination scheme. 4.There is a tree T with maximal cliques of G as vertices. Any two cliques containing v are either adjacent in T or connected by a path of cliques that contain v. 22

23 a a c c b b d d e e C 2 C 3 C 1 a a c c b b C 1 c c b b d d b b d d e e C 2 C 3

24 b b a a d d c c C2C2 C1C1 C3C3 C4C4 b b a a C 1 b b d d d d c c C 4 C 3 a a c c C 2

 Lemma 2: A vertex is simplicial iff it belongs to exactly one clique.  Let G =(V,E) be a chordal graph and |V|=k  Proof by induction: Assume the claim holds for all graphs of size < k.  By Lemma 1 G has a simplicial vertex v.  By Lemma 2 v belongs to exactly one clique C. 25

 For G’ =(V\{v},E’) there exists a tree T’ which satisfies the claim. Split into two cases: ◦ C’ = C – {v} is maximal in G’. Add v to C’ to build T from T’. T is a Clique-Tree as needed. 26 a a c c b b d d e e C2C2 C1C1 a a b b C1C1 b b d d C2C2 e e c c

◦ C’ = C – {v} is not maximal in G’. There is a maximal clique P in G’ such that C’⊂P. Add C and (C, P) to T’ to build T. T is a Clique- Tree as needed. 27 b b a a d d c c C2C2 C1C1 C1C1 a a d d C2C2 c c b b a a d d

 Let T be a Clique-Tree of graph G=(V,E) and |V|=k.  Proof by induction: Assume the claim holds for all graphs of size < k.  Let L be a leaf in T, and P its parent in T.  Let v∈L\P (exists from maximality).  v cannot be in any other clique.  by Lemma 2, v is simplicial. 28

 Let T’ be T with v removed. T’ is a Clique- Tree.  By assumption G’ =(V\{v},E’) is chordal.  By part 3 of Theorem 7, there exists σ’, a Perfect Elimination Order for G’.  Let σ = [v, σ’] be a perfect elimination order for G.  By the converse of part 3, we can conclude that G is chordal 29