Math 239: Discrete Mathematics for the Life Sciences Spring Lecture 14 March 11. Scribe/ Editor: Maria Angelica Cueto/ C.E.
|
|
- Evan Fisher
- 5 years ago
- Views:
Transcription
1 Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 14 March 11 Lecturer: Lior Pachter Scribe/ Editor: Maria Angelica Cueto/ C.E. Csar 14.1 Introduction The goal of today s lecture is to prove the remaining theorem of last lecture characterizing tree additive dissimilarity maps. Namely, Theorem A dissimilarity map δ is tree additive (with respect to a given tree T ) iff δ satisfies the weak four point condition. As we discussed last time, rather than proving this theorem we will change our framework to dissimilarity maps with values in a given group G and provide a more general result in this new setting. In our previous framework, the group G is (R, +), with identity 1 G = 0 and our original Theorem 14.1 will follow immediately from the general result. For general literature including the material discussed today, we refer the reader to the book by Semple and Steel General setting In this section we provide analogous definitions for all concepts developed in Lecture 13. Definition Given a group G a G -dissimilarity map is a map δ : X X G such that δ(x, x) = 1 G for all x X. Note that in this definition we avoid the symmetry condition required for dissimilarity maps. Why have we decided to do so? Two reasons justify our choice: G in general may not be an abelian group, and the general framework for dissimilarity maps realized by trees will allow directed trees with directed edge weights, so that we may have δ(i, j) δ(i, j) for adjacent nodes i, j V (T ), where δ(i, j) denotes the weight of the edge i j. Definition δ is a tree dissimilarity map if there exists a tree T (i.e. a phylogenetic X-tree) and weight function w : E(T ) G such that δ(x, y) = w(e), e path from ϕ(x) to ϕ(y) where ϕ : X V (T ) is the corresponding labeling function and the product is the operation in the group G. 14-1
2 Since (G, G ) may not be abelian, the product defining δ(x, y) must be considered in the order given by the path from x to y, that is if the path is x = v 1 v 1... v r y, then δ(x, y) = w(e v0 v 1 ) G w(e v1 v 2 ) G... G w(e vry). As we discussed before, we may assign weights in each direction of the edges of T Main Theorem We are now in conditions of stating the general result. For simplicity of notation we will avoid the subscript G in the operation of the group G, but the reader should have this in mind. Theorem (Main Theorem) Let G be a group and δ a G -dissimilarity map on X. Consider the set H δ = {δ ik δ 1 jk δ jl δ 1 il i, j, k, l X} G. If δ is a tree dissimilarity map then: 1. i, j, k X : δ ij δ 1 kj δ ki = δ ik δ 1 jk δ ji ( three point condition ); 2. i, j, k, l X pairwise distinct, there exists some ordering of these points (i.e. a relabeling of them) such that δ ik δ 1 jl = δ il δ 1 jl ( four point condition ); Moreover, if δ satisfies the previous conditions and H δ has no element of order 2 in G, then δ is a tree dissimilarity map. Remark: As we discussed previously, Theorem 14.1 will be a consequence of the Main Theorem, since (R, +) has no elements of order 2. The proof of the sufficient conditions of the Main Theorem will mimic the arguments provided on Theorem of last lecture. For this we will need to define the notion of an ultrametric G -dissimilarity map as well as an ultrametric tree representation. We will show that these two definitions are equivalent. The Main Theorem will be proven by induction on X. Given our G -dissimilarity map δ on X satisfying conditions (1) and (2) we will construct a suitable ultrametric on X = X {a}. This will give us an ultrametric tree representation T and we will need to attach a node a and modify the weights of the edges of T in order to obtain our result. The proof of the necessary conditions will be immediate. We will illustrated the desired conditions by an example. i j. Example. Assume δ is a tree metric. We will denote the inverse element δ 1 ij by a squiggly arrow: 14-2
3 Math 239 Lecture 14 March 11 Spring 2008 Each side of condition (1) is given by the following weighted directed arrows. The (LHS) corresponds to k whereas the (RHS) corresponds to i j i j k If we cann u the middle node, and we compute the product of the (LHS) and (RHS) of the equation, we get δ iu δ ui due to several cancellations. Namely, (LHS) = (δ iu δ uj )(δ ku δ uj ) 1 )(δ ku δ ui ) = δ iu δ ui = (δ iu δ uk )(δ ju δ uk ) 1 )(δ ju δ ui ) = (RHS). For condition (2) we have (LHS) equal to whereas the (RHS) is given by i k j l i k j l In this case, we proceed as in condition (1). Call u the node connecting the leaves i and j. We get that both sides of the equation for condition (2) give the same expression δ iu δ 1 ju, so condition (2) also holds. 14-3
4 Several cancellations will provide the equality of each side in conditions (1) and (2). By a similar method we will be able to show that conditions (1) and (2) are necessary for δ to be a tree G -dissimilarity map. So we only need to prove the converse, provided that H δ has no elements of order 2. As we anticipated earlier, the main idea will be to build an ultrametric form δ using the Gromov product: δ x (i, j) = δ xi δ 1 ji δ jx i, j x. Note that this function δ x may not be a dissimilarity map, since δ x (i, i) need not be 1 G. However, the important fact is that δ x will be an ultrametric in a more general setting that we explain later Ultrametric conditions and ultrametric tree representation In this section we define the generalized notion of ultrametric conditions and ultrametric tree representations in context of G -valued functions. Definition We say that δ : X X G satisfies the ultrametric conditions if 1. δ(i, j) = δ(j, i) (i.e., δ is symmetric), 2. {δ(i, j), δ(i, k), δ(j, k)} 2, i.e. we have equality of at least two of these elements of G ( weak three point condition ), 3. (Technical condition for H δ ) There does not exist four pairwise distinct points i, j, k, l X with { δij = δ jk = δ kl } { δjl = δ li = δ ik }. In words, this says that things have to fit together nicely. Before stating the next definition and the key result relating both notions, let us motivate this definition through an example. Example. Assume G = (R, +). Suppose we are given a rooted X-tree T with weights assigned to its edges, which corresponds to a tree metric d. Assume that the distance from the root ρ to each leaf is the same number δ(ρ, x). 1 a ρ b 2 c d 1 e
5 We claim that the edge weighting of the tree T will be equivalent to giving a weight to each internal node of T in the following way. For each internal node v we assign w(v) = 2d(x, v) for any leaf x. Likewise we assign the weigh w(ρ) = 2d(x, ρ) to the root ρ. Since the distance from ρ to each leaf x is the same, this numbers w(v) will be the same for any choice of the leaf x. In our example: ρ a 2 d e b c A first question one might ask is why did we include to add the factor of 2 when defining w(v). A reason for this is that if v is the internal node corresponding to the cherry of the leaves x, y then we have that the weights d(x, v) = w(e xv ) = 1 2 d(x, y) = w(e vy) = d(v, y). In our example we have d(b, c) = 4 = 2( 2). Moreover, in general we have the following identity d(x, y) = label (weight) of the least common ancestor of x and y. So given T and the distance function d in V (T ) provided by the weights on E(T ) we can construct weights for the internal nodes of T. Conversely, assume that we have defined these weights on the internal nodes we want to construct the distance function d. This will be given by assigning a weight to each edge as we ascend from the leaves of T towards the root ρ, bearing in mind that w(v) = 2d(x, v). Since these two weighting representations of a tree T are equivalent, we will define an ultrametric tree representation by simply labeling the internal vertices of a rooted tree via a function t, that is δ(x, y) = t(l.c.a.(x, y)). Note that the weights on the internal nodes are free from any a priori restriction, so this notion can be generalized to take values in an arbitrary set, not necessarily in a fixed group. Definition An ultrametric tree representation is a rooted phylogenetic X-tree, together with a labeling of the (internal) vertices of T by elements of G given by a function t : V (T ) G. We now state the key result for our Main Theorem, without proof because it will be the same as the one provided for the analogous result from Lecture 13. Theorem Given an ultrametric tree representation t, then δ defined by δ(x, y) = t(l.c.a.(x, y)) is an ultrametric. Conversely, given an ultrametric δ we can construct an ultrametric tree representation that realizes δ. 14-5
6 Proof of Main Theorem As we said before, the argument will preceed as follows. We need to show that the three ultrametric conditions are satisfied. By induction we will construct a tree and then we will need to transform it in order to get our tree dissimilarity map. We omit the details since it is very similar to Theorem of last lecture. Remark: Note that, as in Theorem, we have a constructive proof, hence we have an algorithm for building the tree dissimilarity map. As a consequence we obtain Corollary A G -dissimilarity map is tree additive iff it satisfies the weak four point condition. Proof. The four point condition with two equal nodes provides condition (1). On the other hand, condition (2) is just the four point condition. For further details on the previous proof we refer to the book by Semple and Steel Why is this theorem relevant? In this section we aim to discuss the importance of this theorem from a historical perspective. In 1967, a paper by Cavalli-Sforza and Edwards appeared. It was the first paper to discuss statistical approaches to phylogenetics. The idea suggested in that work was the following. Starting with fixed DNA data, build a dissimilarity map in some way (today we would rather use the Jukes-Cantor connection, which was unknown at that time). By the evolutionary theorem we have that δ comes from a tree metric (recall that it came from real DNA data). The goal was to find the corresponding representing tree T. To fulfill this they proposed the following approach. Let T be a phylogenetic tree. Given δ : X X R >0 (which takes positive real values since it corresponds to distances between vertices of T ) the idea was to find ˆδ that minimizes the following expression: (δ ij ˆδ ij ) 2, (*) where ˆδ is a tree metric for T. However, this approach has two main problems: i,j 1. What happens in the case where T is an unknown? One possible solution would be to construct a tree metric ˆδ T for every tree T and find the one that is closest to δ in the sense of (*). 2. The other difficulty we may encounter is how to find an explicit ˆδ minimizing (*). 14-6
7 For the second task, if we weaken our restriction on (*) by allowing ˆδ to be tree additive rather than being a tree metric, then we have a formula computing ˆδ: ˆδ = S T ˆl where S T denotes the incidence matrix and ˆl are optimal weights of the edges of T. In this case, the least squares formula gives: ˆl = (S t T S T ) 1S t T δ, where δ is the given dissimilarity map. Note that in this case we obtain ˆl R E (where E = E(T )) and it may not have positive entries. On the contrary, if we require ˆl (R >0 ) E, we have a constrained least square problem, so the optimization task is harder in this case. In fact, we will need to use an iterative approach to solve it. Moreover in the tree additive setting, ˆl has a very simple formula. Given any edge e E(T ) we have 2 ˆl e = where n A n D + n B n C ( ) n A n C + n B n D ( ) DAC +D BD + DAD +D BC DAB D CD (n A + n B )(n C + n D ) (n A + n B )(n C + n D ) (**) n A = #{labeled nodes in the cluster A } and similarly for B, C and D. D AB = δ ab and similarly for D AC, D BC, D AD, D BD and D CD. a A b B A C ˆl e e B D Note that in this case B, C and D correspond to groups of nodes rather than single nodes. There are two important remarks to make concerning formula (**): Observation: 1. ˆle depends only on δ xy where the path from x y touches the edge e. This is called the group property since we have groups of nodes. We say that the path touches rather than contains the edge e since the paths in D AB only touch e at its left node. Moreover the formula (**) doesn t involve distances between nodes in the same cluster of nodes: we always need to pick one node from each group A, B, C or D. 14-7
8 2. Although less obvious, we have an important complexity result: (**) gives an O(n 2 ) algorithm to find ˆδ, where n = X. So it has the optimal possible complexity. This result is due to Vach (1989). These two facts give a strong argument in favor of considering tree additive maps instead of tree metrics. If we are lucky enough, our algorithms will give tree metrics, but a priori we should expect tree additive maps instead. An example of this general behaviour is the Neighbor-Joining algorithm Homework Exercise (optional): Give a simple direct proof of result Theorem for the case (R, +), i.e. try to avoid passing through the ultrametric construction. (For references to this approach, see a paper by Hakimi and Patinos form the early 1970s.) 14-8
The least-squares approach to phylogenetics was first suggested
Combinatorics of least-squares trees Radu Mihaescu and Lior Pachter Departments of Mathematics and Computer Science, University of California, Berkeley, CA 94704; Edited by Peter J. Bickel, University
More informationCS5238 Combinatorial methods in bioinformatics 2003/2004 Semester 1. Lecture 8: Phylogenetic Tree Reconstruction: Distance Based - October 10, 2003
CS5238 Combinatorial methods in bioinformatics 2003/2004 Semester 1 Lecture 8: Phylogenetic Tree Reconstruction: Distance Based - October 10, 2003 Lecturer: Wing-Kin Sung Scribe: Ning K., Shan T., Xiang
More informationMolecular Evolution and Phylogenetic Tree Reconstruction
1 4 Molecular Evolution and Phylogenetic Tree Reconstruction 3 2 5 1 4 2 3 5 Orthology, Paralogy, Inparalogs, Outparalogs Phylogenetic Trees Nodes: species Edges: time of independent evolution Edge length
More informationa 2n = . On the other hand, the subsequence a 2n+1 =
Math 316, Intro to Analysis subsequences. This is another note pack which should last us two days. Recall one of our arguments about why a n = ( 1) n diverges. Consider the subsequence a n = It converges
More informationPhylogenetic trees 07/10/13
Phylogenetic trees 07/10/13 A tree is the only figure to occur in On the Origin of Species by Charles Darwin. It is a graphical representation of the evolutionary relationships among entities that share
More informationRECOVERING NORMAL NETWORKS FROM SHORTEST INTER-TAXA DISTANCE INFORMATION
RECOVERING NORMAL NETWORKS FROM SHORTEST INTER-TAXA DISTANCE INFORMATION MAGNUS BORDEWICH, KATHARINA T. HUBER, VINCENT MOULTON, AND CHARLES SEMPLE Abstract. Phylogenetic networks are a type of leaf-labelled,
More informationDot Products, Transposes, and Orthogonal Projections
Dot Products, Transposes, and Orthogonal Projections David Jekel November 13, 2015 Properties of Dot Products Recall that the dot product or standard inner product on R n is given by x y = x 1 y 1 + +
More informationEvolutionary Tree Analysis. Overview
CSI/BINF 5330 Evolutionary Tree Analysis Young-Rae Cho Associate Professor Department of Computer Science Baylor University Overview Backgrounds Distance-Based Evolutionary Tree Reconstruction Character-Based
More informationLecture 4: Constructing the Integers, Rationals and Reals
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define
More informationOn improving matchings in trees, via bounded-length augmentations 1
On improving matchings in trees, via bounded-length augmentations 1 Julien Bensmail a, Valentin Garnero a, Nicolas Nisse a a Université Côte d Azur, CNRS, Inria, I3S, France Abstract Due to a classical
More informationReconstructing Trees from Subtree Weights
Reconstructing Trees from Subtree Weights Lior Pachter David E Speyer October 7, 2003 Abstract The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to be a tree
More informationAdditive distances. w(e), where P ij is the path in T from i to j. Then the matrix [D ij ] is said to be additive.
Additive distances Let T be a tree on leaf set S and let w : E R + be an edge-weighting of T, and assume T has no nodes of degree two. Let D ij = e P ij w(e), where P ij is the path in T from i to j. Then
More informationWeek 5: Distance methods, DNA and protein models
Week 5: Distance methods, DNA and protein models Genome 570 February, 2016 Week 5: Distance methods, DNA and protein models p.1/69 A tree and the expected distances it predicts E A 0.08 0.05 0.06 0.03
More informationLecture 9 : Identifiability of Markov Models
Lecture 9 : Identifiability of Markov Models MATH285K - Spring 2010 Lecturer: Sebastien Roch References: [SS03, Chapter 8]. Previous class THM 9.1 (Uniqueness of tree metric representation) Let δ be a
More informationVectors, metric and the connection
Vectors, metric and the connection 1 Contravariant and covariant vectors 1.1 Contravariant vectors Imagine a particle moving along some path in the 2-dimensional flat x y plane. Let its trajectory be given
More informationFinite Metric Spaces & Their Embeddings: Introduction and Basic Tools
Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools Manor Mendel, CMI, Caltech 1 Finite Metric Spaces Definition of (semi) metric. (M, ρ): M a (finite) set of points. ρ a distance function
More informationCombinatorial Aspects of Tropical Geometry and its interactions with phylogenetics
Combinatorial Aspects of Tropical Geometry and its interactions with phylogenetics María Angélica Cueto Department of Mathematics Columbia University Rabadan Lab Metting Columbia University College of
More informationCSCI1950 Z Computa4onal Methods for Biology Lecture 5
CSCI1950 Z Computa4onal Methods for Biology Lecture 5 Ben Raphael February 6, 2009 hip://cs.brown.edu/courses/csci1950 z/ Alignment vs. Distance Matrix Mouse: ACAGTGACGCCACACACGT Gorilla: CCTGCGACGTAACAAACGC
More information2. Introduction to commutative rings (continued)
2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of
More informationCSCI1950 Z Computa4onal Methods for Biology Lecture 4. Ben Raphael February 2, hhp://cs.brown.edu/courses/csci1950 z/ Algorithm Summary
CSCI1950 Z Computa4onal Methods for Biology Lecture 4 Ben Raphael February 2, 2009 hhp://cs.brown.edu/courses/csci1950 z/ Algorithm Summary Parsimony Probabilis4c Method Input Output Sankoff s & Fitch
More informationUC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics. EECS 281A / STAT 241A Statistical Learning Theory
UC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics EECS 281A / STAT 241A Statistical Learning Theory Solutions to Problem Set 2 Fall 2011 Issued: Wednesday,
More informationConsistency Index (CI)
Consistency Index (CI) minimum number of changes divided by the number required on the tree. CI=1 if there is no homoplasy negatively correlated with the number of species sampled Retention Index (RI)
More informationWriting proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction
More informationCHAPTER 3 Further properties of splines and B-splines
CHAPTER 3 Further properties of splines and B-splines In Chapter 2 we established some of the most elementary properties of B-splines. In this chapter our focus is on the question What kind of functions
More informationQuivers of Period 2. Mariya Sardarli Max Wimberley Heyi Zhu. November 26, 2014
Quivers of Period 2 Mariya Sardarli Max Wimberley Heyi Zhu ovember 26, 2014 Abstract A quiver with vertices labeled from 1,..., n is said to have period 2 if the quiver obtained by mutating at 1 and then
More informationEnergy method for wave equations
Energy method for wave equations Willie Wong Based on commit 5dfb7e5 of 2017-11-06 13:29 Abstract We give an elementary discussion of the energy method (and particularly the vector field method) in the
More informationReconstruction of certain phylogenetic networks from their tree-average distances
Reconstruction of certain phylogenetic networks from their tree-average distances Stephen J. Willson Department of Mathematics Iowa State University Ames, IA 50011 USA swillson@iastate.edu October 10,
More information32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
More informationLecture 1: Contraction Algorithm
CSE 5: Design and Analysis of Algorithms I Spring 06 Lecture : Contraction Algorithm Lecturer: Shayan Oveis Gharan March 8th Scribe: Mohammad Javad Hosseini Disclaimer: These notes have not been subjected
More informationLecture: Modeling graphs with electrical networks
Stat260/CS294: Spectral Graph Methods Lecture 16-03/17/2015 Lecture: Modeling graphs with electrical networks Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.
More informationRecitation 8: Graphs and Adjacency Matrices
Math 1b TA: Padraic Bartlett Recitation 8: Graphs and Adjacency Matrices Week 8 Caltech 2011 1 Random Question Suppose you take a large triangle XY Z, and divide it up with straight line segments into
More informationMATH 320, WEEK 7: Matrices, Matrix Operations
MATH 320, WEEK 7: Matrices, Matrix Operations 1 Matrices We have introduced ourselves to the notion of the grid-like coefficient matrix as a short-hand coefficient place-keeper for performing Gaussian
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationTHEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.)
4 Vector fields Last updated: November 26, 2009. (Under construction.) 4.1 Tangent vectors as derivations After we have introduced topological notions, we can come back to analysis on manifolds. Let M
More informationMath 291-2: Lecture Notes Northwestern University, Winter 2016
Math 291-2: Lecture Notes Northwestern University, Winter 2016 Written by Santiago Cañez These are lecture notes for Math 291-2, the second quarter of MENU: Intensive Linear Algebra and Multivariable Calculus,
More informationEVOLUTIONARY DISTANCES
EVOLUTIONARY DISTANCES FROM STRINGS TO TREES Luca Bortolussi 1 1 Dipartimento di Matematica ed Informatica Università degli studi di Trieste luca@dmi.units.it Trieste, 14 th November 2007 OUTLINE 1 STRINGS:
More informationSupplementary Notes on Inductive Definitions
Supplementary Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 August 29, 2002 These supplementary notes review the notion of an inductive definition
More informationLecture 2: Vector Spaces, Metric Spaces
CCS Discrete II Professor: Padraic Bartlett Lecture 2: Vector Spaces, Metric Spaces Week 2 UCSB 2015 1 Vector Spaces, Informally The two vector spaces 1 you re probably the most used to working with, from
More informationLast Update: March 1 2, 201 0
M ath 2 0 1 E S 1 W inter 2 0 1 0 Last Update: March 1 2, 201 0 S eries S olutions of Differential Equations Disclaimer: This lecture note tries to provide an alternative approach to the material in Sections
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationPhylogenetics: Distance Methods. COMP Spring 2015 Luay Nakhleh, Rice University
Phylogenetics: Distance Methods COMP 571 - Spring 2015 Luay Nakhleh, Rice University Outline Evolutionary models and distance corrections Distance-based methods Evolutionary Models and Distance Correction
More informationPhylogeny: traditional and Bayesian approaches
Phylogeny: traditional and Bayesian approaches 5-Feb-2014 DEKM book Notes from Dr. B. John Holder and Lewis, Nature Reviews Genetics 4, 275-284, 2003 1 Phylogeny A graph depicting the ancestor-descendent
More informationAlgorithmic Game Theory and Applications. Lecture 4: 2-player zero-sum games, and the Minimax Theorem
Algorithmic Game Theory and Applications Lecture 4: 2-player zero-sum games, and the Minimax Theorem Kousha Etessami 2-person zero-sum games A finite 2-person zero-sum (2p-zs) strategic game Γ, is a strategic
More informationThus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a
Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:
More informationX X (2) X Pr(X = x θ) (3)
Notes for 848 lecture 6: A ML basis for compatibility and parsimony Notation θ Θ (1) Θ is the space of all possible trees (and model parameters) θ is a point in the parameter space = a particular tree
More informationThe Generalized Neighbor Joining method
The Generalized Neighbor Joining method Ruriko Yoshida Dept. of Mathematics Duke University Joint work with Dan Levy and Lior Pachter www.math.duke.edu/ ruriko data mining 1 Challenge We would like to
More informationAutomorphism groups of wreath product digraphs
Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy
More informationPROBLEM SET 3: PROOF TECHNIQUES
PROBLEM SET 3: PROOF TECHNIQUES CS 198-087: INTRODUCTION TO MATHEMATICAL THINKING UC BERKELEY EECS FALL 2018 This homework is due on Monday, September 24th, at 6:30PM, on Gradescope. As usual, this homework
More informationGroup, Rings, and Fields Rahul Pandharipande. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S,
Group, Rings, and Fields Rahul Pandharipande I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, A binary operation φ is a function, S S = {(x, y) x, y S}. φ
More informationMeasures and Measure Spaces
Chapter 2 Measures and Measure Spaces In summarizing the flaws of the Riemann integral we can focus on two main points: 1) Many nice functions are not Riemann integrable. 2) The Riemann integral does not
More informationCS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions
CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions PRINT Your Name: Answer: Oski Bear SIGN Your Name: PRINT Your Student ID: CIRCLE your exam room: Dwinelle
More informationThe Complex Numbers c ). (1.1)
The Complex Numbers In this chapter, we will study the basic properties of the field of complex numbers. We will begin with a brief historic sketch of how the study of complex numbers came to be and then
More information. Get closed expressions for the following subsequences and decide if they converge. (1) a n+1 = (2) a 2n = (3) a 2n+1 = (4) a n 2 = (5) b n+1 =
Math 316, Intro to Analysis subsequences. Recall one of our arguments about why a n = ( 1) n diverges. Consider the subsequences a n = ( 1) n = +1. It converges to 1. On the other hand, the subsequences
More informationPhysics 110. Electricity and Magnetism. Professor Dine. Spring, Handout: Vectors and Tensors: Everything You Need to Know
Physics 110. Electricity and Magnetism. Professor Dine Spring, 2008. Handout: Vectors and Tensors: Everything You Need to Know What makes E&M hard, more than anything else, is the problem that the electric
More informationLecture Notes on Inductive Definitions
Lecture Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 August 28, 2003 These supplementary notes review the notion of an inductive definition and give
More informationPhylogeny Tree Algorithms
Phylogeny Tree lgorithms Jianlin heng, PhD School of Electrical Engineering and omputer Science University of entral Florida 2006 Free for academic use. opyright @ Jianlin heng & original sources for some
More informationMath 54 Homework 3 Solutions 9/
Math 54 Homework 3 Solutions 9/4.8.8.2 0 0 3 3 0 0 3 6 2 9 3 0 0 3 0 0 3 a a/3 0 0 3 b b/3. c c/3 0 0 3.8.8 The number of rows of a matrix is the size (dimension) of the space it maps to; the number of
More informationInferring Phylogenetic Trees. Distance Approaches. Representing distances. in rooted and unrooted trees. The distance approach to phylogenies
Inferring Phylogenetic Trees Distance Approaches Representing distances in rooted and unrooted trees The distance approach to phylogenies given: an n n matrix M where M ij is the distance between taxa
More informationCS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games
CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games Scribe: Zeyu Guo In the first lecture, we saw three equivalent variants of the classical PCP theorems in terms of CSP, proof checking,
More informationarxiv:math/ v1 [math.co] 20 Apr 2004
arxiv:math/0404370v1 [math.co] 0 Apr 004 Subdominant matroid ultrametrics Federico Ardila Abstract GivenamatroidM onthe groundsete, the Bergmanfan B(M), or space of M-ultrametrics, is a polyhedral complex
More informationLecture 3. 1 Polynomial-time algorithms for the maximum flow problem
ORIE 633 Network Flows August 30, 2007 Lecturer: David P. Williamson Lecture 3 Scribe: Gema Plaza-Martínez 1 Polynomial-time algorithms for the maximum flow problem 1.1 Introduction Let s turn now to considering
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationUniversity of California Berkeley CS170: Efficient Algorithms and Intractable Problems November 19, 2001 Professor Luca Trevisan. Midterm 2 Solutions
University of California Berkeley Handout MS2 CS170: Efficient Algorithms and Intractable Problems November 19, 2001 Professor Luca Trevisan Midterm 2 Solutions Problem 1. Provide the following information:
More informationProperties of θ-super positive graphs
Properties of θ-super positive graphs Cheng Yeaw Ku Department of Mathematics, National University of Singapore, Singapore 117543 matkcy@nus.edu.sg Kok Bin Wong Institute of Mathematical Sciences, University
More information7 Curvature of a connection
[under construction] 7 Curvature of a connection 7.1 Theorema Egregium Consider the derivation equations for a hypersurface in R n+1. We are mostly interested in the case n = 2, but shall start from the
More informationLecture 2 Some Sources of Lie Algebras
18.745 Introduction to Lie Algebras September 14, 2010 Lecture 2 Some Sources of Lie Algebras Prof. Victor Kac Scribe: Michael Donovan From Associative Algebras We saw in the previous lecture that we can
More informationLecture 4 October 18th
Directed and undirected graphical models Fall 2017 Lecture 4 October 18th Lecturer: Guillaume Obozinski Scribe: In this lecture, we will assume that all random variables are discrete, to keep notations
More information25 Minimum bandwidth: Approximation via volume respecting embeddings
25 Minimum bandwidth: Approximation via volume respecting embeddings We continue the study of Volume respecting embeddings. In the last lecture, we motivated the use of volume respecting embeddings by
More informationLecture Notes on Inductive Definitions
Lecture Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 September 2, 2004 These supplementary notes review the notion of an inductive definition and
More informationDefinition 5.1. A vector field v on a manifold M is map M T M such that for all x M, v(x) T x M.
5 Vector fields Last updated: March 12, 2012. 5.1 Definition and general properties We first need to define what a vector field is. Definition 5.1. A vector field v on a manifold M is map M T M such that
More information6.842 Randomness and Computation March 3, Lecture 8
6.84 Randomness and Computation March 3, 04 Lecture 8 Lecturer: Ronitt Rubinfeld Scribe: Daniel Grier Useful Linear Algebra Let v = (v, v,..., v n ) be a non-zero n-dimensional row vector and P an n n
More informationEigenvectors and Hermitian Operators
7 71 Eigenvalues and Eigenvectors Basic Definitions Let L be a linear operator on some given vector space V A scalar λ and a nonzero vector v are referred to, respectively, as an eigenvalue and corresponding
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationCHAPTER 4: EXPLORING Z
CHAPTER 4: EXPLORING Z MATH 378, CSUSM. SPRING 2009. AITKEN 1. Introduction In this chapter we continue the study of the ring Z. We begin with absolute values. The absolute value function Z N is the identity
More informationLecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
More informationMath 4320, Spring 2011
Math 4320, Spring 2011 Prelim 2 with solutions 1. For n =16, 17, 18, 19 or 20, express Z n (A product can have one or more factors.) as a product of cyclic groups. Solution. For n = 16, G = Z n = {[1],
More informationMath 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank
Math 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank David Glickenstein November 3, 4 Representing graphs as matrices It will sometimes be useful to represent graphs
More informationFaithful Tropicalization of the Grassmannian of planes
Faithful Tropicalization of the Grassmannian of planes Annette Werner (joint with Maria Angelica Cueto and Mathias Häbich) Goethe-Universität Frankfurt am Main 2013 1 / 28 Faithful Tropicalization 2013
More informationMath 1060 Linear Algebra Homework Exercises 1 1. Find the complete solutions (if any!) to each of the following systems of simultaneous equations:
Homework Exercises 1 1 Find the complete solutions (if any!) to each of the following systems of simultaneous equations: (i) x 4y + 3z = 2 3x 11y + 13z = 3 2x 9y + 2z = 7 x 2y + 6z = 2 (ii) x 4y + 3z =
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Dynamic Programming II Date: 10/12/17
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Dynamic Programming II Date: 10/12/17 12.1 Introduction Today we re going to do a couple more examples of dynamic programming. While
More informationPHYS 705: Classical Mechanics. Rigid Body Motion Introduction + Math Review
1 PHYS 705: Classical Mechanics Rigid Body Motion Introduction + Math Review 2 How to describe a rigid body? Rigid Body - a system of point particles fixed in space i r ij j subject to a holonomic constraint:
More informationAditya Bhaskara CS 5968/6968, Lecture 1: Introduction and Review 12 January 2016
Lecture 1: Introduction and Review We begin with a short introduction to the course, and logistics. We then survey some basics about approximation algorithms and probability. We also introduce some of
More informationCS281A/Stat241A Lecture 19
CS281A/Stat241A Lecture 19 p. 1/4 CS281A/Stat241A Lecture 19 Junction Tree Algorithm Peter Bartlett CS281A/Stat241A Lecture 19 p. 2/4 Announcements My office hours: Tuesday Nov 3 (today), 1-2pm, in 723
More informationSZEMERÉDI S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS
SZEMERÉDI S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS ALEXANDER SCOTT Abstract. Szemerédi s Regularity Lemma is an important tool for analyzing the structure of dense graphs. There are versions of
More informationSOME STRUCTURE THEOREMS FOR INVERSE LIMITS WITH SET-VALUED FUNCTIONS
http://topology.auburn.edu/tp/ TOPOLOGY PROCEEDINGS Volume 42 (2013) Pages 237-258 E-Published on January 10, 2013 SOME STRUCTURE THEOREMS FOR INVERSE LIMITS WITH SET-VALUED FUNCTIONS M. M. MARSH Abstract.
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14 Introduction One of the key properties of coin flips is independence: if you flip a fair coin ten times and get ten
More informationMathematical Methods wk 2: Linear Operators
John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationRECURSION EQUATION FOR
Math 46 Lecture 8 Infinite Horizon discounted reward problem From the last lecture: The value function of policy u for the infinite horizon problem with discount factor a and initial state i is W i, u
More informationMetric spaces and metrizability
1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively
More informationOn the Limiting Distribution of Eigenvalues of Large Random Regular Graphs with Weighted Edges
On the Limiting Distribution of Eigenvalues of Large Random Regular Graphs with Weighted Edges Leo Goldmakher 8 Frist Campus Ctr. Unit 0817 Princeton University Princeton, NJ 08544 September 2003 Abstract
More informationALGORITHMS FOR RECONSTRUCTING PHYLOGENETIC TREES FROM DISSIMILARITY MAPS
ALGORITHMS FOR RECONSTRUCTING PHYLOGENETIC TREES FROM DISSIMILARITY MAPS DAN LEVY, FRANCIS EDWARD SU, AND RURIKO YOSHIDA Manuscript, December 15, 2003 Abstract. In this paper we improve on an algorithm
More informationTopic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007
CS880: Approximations Algorithms Scribe: Tom Watson Lecturer: Shuchi Chawla Topic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007 In the last lecture, we described an O(log k log D)-approximation
More informationCS367 Lecture 3 (old lectures 5-6) APSP variants: Node Weights, Earliest Arrivals, Bottlenecks Scribe: Vaggos Chatziafratis Date: October 09, 2015
CS367 Lecture 3 (old lectures 5-6) APSP variants: Node Weights, Earliest Arrivals, Bottlenecks Scribe: Vaggos Chatziafratis Date: October 09, 2015 1 The Distance Product Last time we defined the distance
More informationEECS 598: Statistical Learning Theory, Winter 2014 Topic 11. Kernels
EECS 598: Statistical Learning Theory, Winter 2014 Topic 11 Kernels Lecturer: Clayton Scott Scribe: Jun Guo, Soumik Chatterjee Disclaimer: These notes have not been subjected to the usual scrutiny reserved
More informationFactorization in Domains
Last Time Chain Conditions and s Uniqueness of s The Division Algorithm Revisited in Domains Ryan C. Trinity University Modern Algebra II Last Time Chain Conditions and s Uniqueness of s The Division Algorithm
More informationHOMEWORK 2 - RIEMANNIAN GEOMETRY. 1. Problems In what follows (M, g) will always denote a Riemannian manifold with a Levi-Civita connection.
HOMEWORK 2 - RIEMANNIAN GEOMETRY ANDRÉ NEVES 1. Problems In what follows (M, g will always denote a Riemannian manifold with a Levi-Civita connection. 1 Let X, Y, Z be vector fields on M so that X(p Z(p
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More information