Example: Hardy-Weinberg Equilibrium. Algebraic Statistics Tutorial I. Phylogenetics. Main Point of This Tutorial. Model-Based Phylogenetics
|
|
- Opal Janice Murphy
- 5 years ago
- Views:
Transcription
1 Example: Hardy-Weinberg Equilibrium Algebraic Statistics Tutorial I Seth Sullivant North Carolina State University July 22, 2012 Suppose a gene has two alleles, a and A. If allele a occurs in the population with frequency θ (and A with frequency 1 θ) and these alleles are in Hardy-Weinberg equilibrium, the genotype frequencies are P(X = aa)=θ 2, P(X = aa)=2θ(1 θ), P(X = AA)=(1 θ) 2 The model of Hardy-Weinberg equilibrium is the set M = θ 2, 2θ(1 θ),(1 θ) 2 θ [0, 1] 3 I(M)=p aa +p aa +p AA 1, p 2 aa 4p aap AA Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Main Point of This Tutorial Phylogenetics Given a collection of species, find the tree that explains their history. Many statistical models are described by (semi)-algebraic constraints on a natural parameter space. Generators of the vanishing ideal can be useful for constructing algorithms or analyzing properties of statistical model. Two Examples Phylogenetic Algebraic Geometry Sampling Contingency Tables Data consists of aligned DNA sequences from homologous genes Human: Chimp: Gorilla:...ACCGTGCAACGTGAACGA......ACCTTGGAAGGTAAACGA......ACCGTGCAACGTAAACTA... Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Model-Based Phylogenetics Use a probabilistic model of mutations Parameters for the model are the combinatorial tree T, and rate parameters for mutations on each edge Models give a probability for observing a particular aligned collection of DNA sequences Phylogenetic Models Assuming site independence: Phylogenetic Model is a latent class graphical model Vertex v T gives a random variable X v {A,C,G,T} All random variables corresponding to internal nodes are latent Human: Chimp: Gorilla: ACCGTGCAACGTGAACGA ACGTTGCAAGGTAAACGA ACCGTGCAACGTAAACTA X 1 X 2 X 3 Y 2 Assuming site independence, data is summarized by empirical distribution of columns in the alignment. e.g. ˆp(AAA)= 6 18, ˆp(CGC)= 2 18, etc. Use empirical distribution and test statistic to find tree best explaining data P(x 1, x 2, x 3 )= y 1 Y 1 y 2 P(y 1 )P(y 2 y 1 )P(x 1 y 1 )P(x 2 y 2 )P(x 3 y 2 ) Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32
2 Phylogenetic Models Assuming site independence: Phylogenetic Model is a latent class graphical model Vertex v T gives a random variable X v {A,C,G,T} All random variables corresponding to internal nodes are latent p i1 i 2 i 3 = j 1 X 1 X 2 X 3 Y 1 Y 2 j 2 π j1 a j2,j 1 b i1,j 1 c i2,j 2 d i3,j 2 Algebraic Perspective on Phylogenetic Models Once we fix a tree T and model structure, we get a map φ T : Θ R 4n. Θ R d is a parameter space of numerical parameters (transition matrices associated to each edge). The map φ T is given by polynomial functions of the parameters. For each i 1 i n {A, C, G, T} n, φ T i 1 in (θ) gives the probability of the column (i 1,...,i n ) in the alignment for the particular parameter choice θ. φ T i 1 i 2 i 3 (π, a, b, c, d)= π j1 a j2,j 1 b i1,j 1 c i2,j 2 d i3,j 2 j 1 j 2 The phylogenetic model is the set M T = φ T (Θ) R 4n. Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Phylogenetic Varieties and Phylogenetic Invariants X 1 X 2 X3 X4 Let R[p]:=R[p i1 in : i 1 i n {A, C, G, T} n ] Let I T := f R[p]:f(p)=0 for all p M T R[p]. I T is the ideal of phylogenetic invariants of T. Let V T := {p R 4n : f(p)=0 for all f I T }. V T is the phylogenetic variety of T. Note that M T V T. Since M T is image of a polynomial map dimm T = dim V T. Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 p lmno = π i a ij b ik c jl d jm e kn f ko i=1 j=1 k= = π i a ij c jl d jm b ik e kn f ko i=1 j=1 k=1 p 1111 p 1112 p 1144 p = rank 1211 p 1212 p p 4411 p 4412 p 4444 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Splits and Phylogenetic Invariants 2-way Flattenings and Matrix Ranks A split of a set is a bipartition A B. A split A B of the leaves of a tree T is valid for T if the induced trees T A and T B do not intersect. X 1 X 2 X3 X4 Valid: Not Valid: Proposition Let P M T. p ijkl = P(X 1 = i, X 2 = j, X 3 = k, X 4 = l) p AAAA p AAAC p AAAG p AATT p ACAA p ACAC p ACAG p ACTT Flat (P)= p TTAA p TTAC p TTAG p TTTT If A B is a valid split for T, then rank(flat A B (P)) 4. Invariants in I T are subdeterminants of Flat A B (P). If C D is not a valid split for T, then generically rank(flat C D (P)) > 4. Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32
3 Phylogenetic Algebraic Geometry Using Phylogenetic Invariants to Reconstruct Trees Phylogenetic Algebraic Geometry is the study of the phylogenetic varieties and ideals V T and I T. Using Phylogenetic Invariants to Reconstruct Trees Identifiability of Phylogenetic Models Interesting Math Useful in Other s A phylogenetic invariant f I T is phylogenetically informative if there is some other tree T such that f / I T. Idea of Cavender-Felsenstein (1987), Lake (1987): Evaluate phylogenetically informative phylogenetic invariants at empirical distribution ˆp to reconstruct phylogenetic trees Proposition For each n-leaf trivalent tree T, let F T I T be a set of phylogenetic invariants such that, for each T = T, there is an f F T, such that f / I T. Let f T := f F T f. Then for generic p M T,f T (p)=0 if and only if p M T. Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Performance of Invariants Methods in Simulations Identifiability of Phylogenetic Models Huelsenbeck (1995) did a systematic simulation comparison of 26 different methods of constructing a phylogenetic tree on 4 leaf trees. Invariant-based methods did poorly. HOWEVER... Huelsenbeck only used linear invariants. Casanellas, Fernandez-Sanchez (2006) redid these simulations using a generating set of the phylogenetic ideal I T. Phylogenetic invariants become comparable to other methods. For the particular model studied in Casanellas, Fernandez-Sanchez (2006) for a tree with 4 leaves, the ideal I T has 8002 generators. f T := f F T f is a sum of 8002 terms. Major work to overcome combinatorial explosion for larger trees. A parametric statistical model is identifiable if it gives 1-to-1 map from parameters to probability distributions. Is it possible to infer the parameters of the model from data? Identifiability guarantees consistency of statistical methods (ML) Two types of parameters to consider for phylogenetic models: Numerical parameters (transition matrices) Tree parameter (combinatorial type of tree) Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Geometric Perspective on Identifiability Generic Identifiability The unrooted tree parameter T in a phylogenetic model is identifiable if for all p M T there does not exist another T = T such that p M T. The tree parameter in a phylogenetic model is generically identifiable if for all n-leaf trees with T = T, dim(m T M T ) < min(dim(m T ), dim(m T )). M1 M2 M1 M2 M1 M2 M3 M3 Identifiable Not Identifiable Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32
4 Proving Identifiability with Algebraic Geometry Phylogenetic Models are Identifiable Proposition Let M 0 and M 1 be two algebraic models. If there exist phylogenetically informative invariants f 0 and f 1 such that f i (p)=0 for all p M i, and f i (q) = 0 for some q M 1 i, then dim(m 0 M 1 ) < min(dimm 0, dimm 1 ). M0 f = 0 M 1 Theorem The unrooted tree parameter of phylogenetic models is generically identifiable. Proof. Edge flattening invariants can detect which splits are implied by a specific distribution in M T. The splits in T uniquely determine T. Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Phylogenetic Mixture Models Basic phylogenetic model assume same parameters at every site This assumption is not accurate within a single gene Some sites more important: unlikely to change Tree structure may vary across genes Leads to mixture models for different classes of sites M(T, r) denotes a same tree mixture model with underlying tree T and r classes of sites Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Identifiability Questions for Mixture Models Question For fixed number of trees r, are the tree parameters T 1,...,T r, and rate parameters of each tree (generically) identified in phylogenetic mixture models? r = 1 (Ordinary phylogenetic models) Most models are identifiable on 2, 3, 4 leaves. ( Rogers, Chang, Steel, Hendy, Penny, Székely, Allman, Rhodes, Housworth,...) r > 1 T 1 = T 2 = = T r but no restriction on number of trees Not identifiable (Matsen-Steel, Stefankovic-Vigoda) r > 1, T i arbitrary Not identifiable (Mossel-Vigoda) Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 How to Construct Phylogenetic Invariants? Theorem (Rhodes-Sullivant 2011) The unrooted tree and numerical parameters in a r-class, same tree phylogenetic mixture model on n-leaf trivalent trees are generically identifiable, if r < 4 n/4. Proof Ideas. Phylogenetic invariants from flattenings Tensor rank (Kruskal s Theorem) [Allman-Matias-Rhodes 2009] Elementary tree combinatorics Solving tree and numerical parameter identifiability at the same time Theorem (Sturmfels-S, Allman-Rhodes, Casanellas-S, Draisma-Kuttler) Consider nice algebraic phylogenetic model. The problem of computing phylogenetic invariants for any tree T can be reduced to the same problem for star trees K 1,k. The ideal I T generated by local contributions from each K 1,k, plus flattening invariants from edges. The varieties V K1,k are interesting classical algebraic varieties: toric varieties secant varieties Sec 4 (P 3 P 3 P 3 ) Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32
5 Group-based models Equations for the CFN Model αβ βα αβββ βαββ ββαβ βββα αβγγ βαγγ γ γ α β γ γ β α αβγδ βαδγ γ δ α β δ γ β α Theorem (Sturmfels-S 2005) For any tree T, the toric ideal I T for the CFN model is generated by degree 2 determinantal equations. Random variables in finite abelian group G. Transitions probabilities satisfy Prob(X = g Y = h)= f(g + h). This means that the formula for Prob(X 1 = g 1,...,X n = g n ) is a convolution (over G n ). Apply discrete Fourier transform to turn convolution into a product. Theorem (Hendy-Penny 1993, Evans-Speed 1993) In the Fourier coordinates, a group-based model is parametrized by monomial functions in terms of the Fourier parameters. In particular, the CFN model is a toric variety. X 1 X 3 X 4 X 2 Fourier coordinates: q0000 q 0001 q 0010 q 0011 q 1100 q 1101 q 1110 q 1111 q0100 q 0101 q 0110 q 0111 q 1000 q 1001 q 1010 q 1011 q lmno = r,s,t,u {0,1} ( 1)rl+sm+tn+uo p rstu I T generated by 2 2 minors of: q 0000 q 0011 q 0001 q 0010 q 0100 q 0111 q 0101 q 0110 q 1000 q 1011 q 1001 q 1010 q 1100 q 1111 q 1101 q 1110 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Gluing Two Trees at a Leaf Gluing more complex graphs + = + = Let T = T 1 #T 2, tree obtained by joining two trees at a leaf. Each ring C[p]/I T1, C[p]/I T2 is invariant under action of group G = Gl r (C) k acting on the glue leaves. Theorem (Draisma-Kuttler) C[p]/I T = (C[p]/IT1 C C[p]/I T2 ) G V T =(V T1 V T2 )//G (GIT quotient) Actions of individual factors (Gl r (C)) do no interact. Use Reynolds operator and first fundamental theorem of CIT. Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Still a group action (Gl r (C) k ). But factors are not acting independently. C[p]/I G = (C[p]/I G1 C C[p]/I G2 ) G C[p]/I G generated by degree 1 part of (C[p]/I G1 C C[p]/I G2 ) G (toric fiber product if r = 1) Theorem (Engström-Kahle-S) Can determine generators of I G from I G1 and I G2 if the TFP has low codimension. Useful for other problems in algebraic statistics. Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Summary: Phylogenetic Algebraic Geometry Phylogenetic models are fundamentally algebraic-geometric objects. Algebraic perspective is useful for: Developing new construction algorithms Proving theorems about identifiability (currently best available for mixture models) Leads to interesting new mathematics, useful for other problems Long way to go: Your Help Needed! s Theorem (Allman-Rhodes 2006) Let T be a trivalent tree with n leaves, and consider the general Markov model on binary characters. The phylogenetic ideal I T has generating set {3 3 minors of Flat A B (P)} A B Σ(T) where Σ(T) is the set of all valid splits on T. Note that P is a 2 2 2, n-way tensor. For the 5 leaf tree at the right and write down all the matrices Flat A B (P) that are needed in the previous theorem Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32
6 References E. Allman, C. Matias, J. Rhodes. Identifiability of parameters in latent structure models with many observed variables. Annals of Statistics, 37 no.6a (2009) M. Casanellas, J. Fernandez-Sanchez. Performance of a new invariants method on homogeneous and non-homogeneous quartet trees, Molecular Biology and Evolution, 24(1): , J. Cavender, J. Felsenstein. Invariants of phylogenies: a simple case with discrete states. Journal of Classification 4 (1987) J. Draisma, J Kuttler. On the ideals of equivariant tree models, Mathematische Annalen 344(3): , A. Engström, T. Kahle, S. Sullivant. Multigraded commutative algebra of graph decompositions S. Evans and T. Speed. Invariants of some probability models used in phylogenetic inference. Annals of Statistics 21 (1993) F.A. Matsen and M. Steel. Phylogenetic mixtures on a single tree can mimic a tree of another topology. Systematic Biology, E. Mossel and E. Vigoda Phylogenetic MCMC Are Misleading on Mixtures of Trees. Science 309, (2005) J. Rhodes, S. Sullivant. Identifiability of large phylogenetic mixture models. To appear Bulletin of Mathematical Biology, D. Stefankovic and E. Vigoda. Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction Systematic Biology 56(1): , B. Sturmfels, S. Sullivant. Toric ideals of phylogenetic invariants. Journal of Computational Biology 12 (2005) M. Hendy, D. Penny. Spectral analysis of phylogenetic data. J. Classification 10 (1993) J. Huelsenbeck. Performance of phylogenetic methods in simulation. Systematic Biology 42 no.1 (1995) J. Lake. A rate-independent technique for analysis of nucleaic acid sequences: evolutionary parsimony. Molecular Biology and Evolution 4 (1987) Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32 Seth Sullivant (NCSU) Algebraic Statistics July 22, / 32
7 Generating Random Tables Algebraic Statistics Tutorial II Generate a random table from the set of all nonnegative k 1 k 2 integer tables with given row and column sums. Seth Sullivant North Carolina State University June 10, 2012 c 1 c 2 c 3 c 4 r 1 r 2 r 3 Fisher s Exact Test, Missing Data s Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Random Walk Connecting Lattice Points in Polytopes = = Let A : Z n Z d a linear transformation, b Z d. A 1 [b]:={x N n : Ax = b} (fiber) B ker Z A Let A 1 [b] B be the graph with vertex set A 1 [b] and u v an edge if and only u v ±B , , allow for a connected random walk over these contingency tables. Given A and b, find finite B ker Z A such that A 1 [b] B is connected. If B ker Z A is a set such that A 1 [b] B is connected for all b, then B is a Markov basis for A. Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Example: 2-way tables Let A : Z k 1 k 2 Z k 1+k 2 such that m m k k A(u) = u 1j,..., u k1 j; u i1,..., u ik2 j=1 j=1 i=1 i=1 = vector of row and column sums of u ker Z (A)={u Z k 1 k 2 : row and columns sums of u are 0} Markov basis consists of the 2 k 1 k2 2 2 moves like: way tables Let A : Z k 1 k 2 k 3 Z k 1 k 2 +k 1 k 3 +k 2 k 3 be the linear transformation such that A(u) = ( i3 u i1 i 2 i 3 ) i1,i 2 ;( u i1 i 2 i 3 ) i1 i 3 ;( u i1 i 2 i 3 ) i2,i 3 i 2 i 1 = all 2-way margins of 3-way table u = all line sums of u. Markov basis depends on k 1, k 2, k 3, contains moves like: but also non-obvious moves like: Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28
8 Fundamental Theorem of Markov Bases Let A : Z n Z d. The toric ideal I A is the ideal p u p v : u, v N n, Au = Av K[p 1,...,p n ], where p u = p u 1 1 pu 2 2 pun n. Theorem (Diaconis-Sturmfels 1998) The set of moves B ker Z A is a Markov basis for A if and only if the set of binomials {p b+ p b : b B} generates I A p 21 p 33 p 23 p Toric Varieties = Log-linear Models The variety V A = V(I A ) is a toric variety. The statistical model M A = V(I A ) m is a log-linear model. M A = {p m : log p rowspan A}. Fisher s exact test: Does the data u fit the model M A? u/ u Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 2-way tables: Independence Computing Markov Bases p 21 p 33 p 23 p 31 = p 21 p 23 p p 33 p 11 p 12 p 1k2 p 21 p 22 p 2k2 I A = 2 2 minors of p k1 1 p k p k1 k 2 V A = V(I A )={P R k 1 k 2 : rank P 1} Software 4ti2 Macaulay2 (4ti2 interface) Singular (toric package) Theory Gluing Results Finiteness Theorems Special Configurations M A = V A k1 k 2 = M X1 X 2 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 No Hope Theorem Theorem (De Loera-Onn (2006)) Every integer vector appears as part of a minimal Markov basis element for 3 k 2 k 3 tables (with fixed 2-way margins). In particular, minimal Markov basis elements for 3-way tables can have arbitrarily large entries and arbitrarily large 1-norm. Example (3 4 6-tables) For tables, minimal Markov basis has elements. Largest element has 1-norm 28. Which Fibers are Connected? Let B ker Z A. For which b is A 1 [b] B connected? When do u, v A 1 [b] belong to the same component of A 1 [b] B? Example (2 3) B = 1 1 0, Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28
9 3 3 Enter Commutative Algebra Let K[p]:=K[p 1,...,p n ]. To each m B associate a binomial p m+ p m K[p] where m = m + m, p m = p m 1 1 pmn n. Proposition Let B ker Z A. Then u, v A 1 [b] are in the same component of A 1 [b] B if and only if p u p v I B := p m+ p m : m B. Theorem (Diaconis-Sturmfels (1998)) A set of moves B ker Z A is a Markov basis if and only if Lattice Walks and Primary Decomposition (Diaconis-Eisenbud-Sturmfels 1998) Decompose ideal I B = i I i. p u p v I B p u p v I i for all i. Hope that ideal I i are easier to analyze. Theorem (Eisenbud-Sturmfels 1996) Every binomial ideal has a binomial primary decomposition. Dickenstein-Matusevich-Miller, Kahle-Miller (Mesoprimary decomposition) Algorithms implemented inbinomials.m2 (Kahle 2010) I B = I A := p u p v : u, v N n, Au = Av. Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / tables B = 1 1 0, p I B = 11 p 12 p 21 p 22, p 12 p 13 p 22 p 23 p = 11 p 12 p 21 p 22, p 12 p 13 p 22 p 23, p 11 p 13 p 21 p 23 p 21, p 22 = I A p 21, p 22 u11 u 12 u 13 v11 v 12 v 13 connected by B if and only if u 21 u 22 u 23 v 21 v 22 v 23 they have the same row and column sums and u 12 + u 22 = v 12 + v 22 > 0. Graphical Models G a graph, N-vertices. d Z N, d i 2. Gives set of margins of d 1 d 2 d n array. C(G)=set of maximal cliques in G. Let A G,d : Z d 1 dn Z k be the linear map that computes the margins associated to all C C(G), of a d 1 d n array. Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Example (Row and Column Sums) A G,d : Z d 1 d 2 Z d 1+d 2 (u ij ) i,j (( u ij ) i,( u ij ) j ) j i A G,d : Z d 1 d 2 d 3 Z d 1 d 2 +d 1 d 3 (u ijk ) i,j,k (( u ijk ) i,j,( u ijk ) i,k ) k j Example (Path) Example (4-cycle) A G,d : Z d 1 d 2 d 3 Z d 1 d 2 +d 1 d 3 (u ijk ) i,j,k (( u ijk ) i,j,( u ijk ) i,k ) k j A G,d : Z d 1 d 2 d 3 d 4 Z d 1 d 2 +d 1 d 3 +d 2 d 4 +d 3 d 4 d =(2, 2, 3) A G,d = C(G)={{1, 2},{1, 3},{2, 4},{3, 4}} u =(u 111, u 112, u 113, u 121, u 122, u 123, u 211, u 212, u 213, u 221, u 222, u 223 ) Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28
10 Separating Moves (Conditional Independence) Let A, B, C partition V(G) such that C separates A and B in G. Get moves e ia i B i C + e ja j B i C e ia j B i C e ja i B i C where i A, j A t A [d t], i B, j B t B [d t], i C t C [d t] in ker Z A G,d. 1 1 These moves naturally generalize for 2-way tables. 1 1 CI(G) is set of all separating moves. Example (4-cycle) e i1 i 2 i 3 i 4 + e j1 i 2 i 3 j 4 e i1 i 2 i 3 j 4 e j1 i 2 i 3 i 4 Which Fibers Do CI(G) Moves Connect? Proposition (Hammersley-Clifford, Besag (1974)) CI(G) spans ker Z A G,d for all G. Theorem (Dobra (2002), Geiger, Meek, Sturmfels (2006)) Separating moves CI(G) are a Markov basis for A G,d if and only if G is a chordal graph. 1 Which fibers A 1 G,d [b] are connected by CI(G) for other graphs? 2 What is the primary decomposition of I CI(G)? 3 4 e i1 i 2 i 3 i 4 + e i1 j 2 j 3 i 4 e i1 i 2 j 3 i 4 e i1 j 2 i 3 i 4 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Computational Results Theorem (Kahle-Rauh-S (2012)) Let #V(G)=n 5,d i = 2 for all i. Then I CI(G) is radical. A 1 G,d [b] CI(G) is connected if b is in the interior of the marginal cone. A 1 G,d [b] CI(G) is connected if b is positive (except for G = K 2,3 ). Every prime component I B of the form P S = p i : i S+I AS. Form vector u S := i/ S e i. Check if Au S is on boundary of marginal cone for all prime components. If so B has interior point property. 2 3 tables B = 1 1 0, p I B = 11 p 12 p 21 p 22, p 12 p 13 p 22 p 23 = I A p 21, p 22 Analyze monomial ideal P S = p 21, p u S = u S has a zero column sum all fibers with positive margins (row and column sums) are connected. Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Theoretical Results Proposition (Kahle-Rauh-S (2012)) If G = G 1 #G 2 is a clique sum, then If I CI(G1 ) and I CI(G2 ) radical, so is I CI(G). If G 1 and G 2 satisfy interior point property, so does G. If G 1 and G 2 satisfy positive margins property, so does G. + = Theorem (Kahle-Rauh-S (2012)) 1 For cycle C n,i CI(Cn) is radical, when d i = 2 for all i. 2 For K 2,n with d 1 = d 2 = 2,I CI(K2,n ) is radical. Proof Ideas Find minimal primes for I CI(G). All binomial ideals. Let J = I CI(G) = I AG,d k i=1 P i. Let u, v such that A G,d u = A G,d v, so p u p v I A. Connect u and v using Markov basis moves of A G,d. Show that p u p v P i for all i, implies we can shortcut moves with CI(G) moves. Deduce that J = I CI(G). Depends on having Markov basis of A G,d, which is obtained in these cases via toric fiber product. (Engström, Kahle, S 2011) 3 Interior point property holds in both situations. Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28
11 Questions Summary Question Is I CI(G) radical for all G, d? Does interior point property hold for all G, d? Theorem If there are n 2 mutually orthogonal d d latin squares, then for any 2-connected, triangle free graph on G nodes, and d i = d for all i, the interior point property does not hold for (G, d). For C 4 and d =(3, 3, 3, 3) gives failure of interior point property. Radicality fails for K 3,3 and d =(2, 2, 2, 2, 2, 2). Many statistical problems require the construction of random walks over the lattice points in a polytope. A Markov basis provides connectivity for all b. If Markov basis too hard to compute, can ask: Which fibers are connected by a natural set of moves? Binomial primary decomposition gives information about connectivity of fibers with subset of Markov basis. Computational and theoretical advances allow us to make progress on graphical models. Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 s References 3 4 J. Besag. (1974) Spatial Interaction and the Statistical Analysis of Lattice Systems, Journal of the Royal Statistical Society, Series B, 36 (2), 192Ð236. J. De Loera, S. Onn. Markov bases of three-way tables are arbitrarily complicated. Journal of Symbolic Computation, 41: , P. Diaconis, D. Eisenbud, B. Sturmfels. Lattice walks and primary decomposition, Mathematical Essays in Honor of Gian-Carlo Rota, eds. B. Sagan and R. Stanley, Progress in Mathematics, Vol. 161, Birkhauser, Boston, 1998, pp P. Diaconis and B. Sturmfels. Algebraic algorithms for sampling from conditional distributions, Annals of Statistics 26 (1998) A. Dickenstein, L. Matusevich, E. Miller. Combinatorics of binomial primary decomposition Let d =(2, 2, 2, 2). Construct the matrix A C4,d. 2 List the elements of CI(C 4 ) 3 Use 4ti2, Macaulay2, or Singular to compute the Markov basis of C 4. A. Dobra. Markov bases for decomposable graphical models. Bernoulli 9 No. 6,(2003) D. Eisenbud, B. Sturmfels. Binomial ideals, Duke Mathematical Journal 84 (1996) A. Engström, T. Kahle, S. Sullivant. Multigraded commutative algebra of graph decompositions. (2011) D. Geiger, C. Meek, B. Sturmfels. On the toric algebra of graphical models, Annals of Statistics 34 (2006) T. Kahle, E. Miller. Decompositions of commutative monoid congruences and binomial ideals.arxiv: T. Kahle, J. Rauh, S. Sullivant. Positive margins and primary decomposition. (2012) Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28 Seth Sullivant (NCSU) Algebraic Statistics June 10, / 28
Algebraic Statistics Tutorial I
Algebraic Statistics Tutorial I Seth Sullivant North Carolina State University June 9, 2012 Seth Sullivant (NCSU) Algebraic Statistics June 9, 2012 1 / 34 Introduction to Algebraic Geometry Let R[p] =
More informationPhylogenetic Algebraic Geometry
Phylogenetic Algebraic Geometry Seth Sullivant North Carolina State University January 4, 2012 Seth Sullivant (NCSU) Phylogenetic Algebraic Geometry January 4, 2012 1 / 28 Phylogenetics Problem Given a
More informationIntroduction to Algebraic Statistics
Introduction to Algebraic Statistics Seth Sullivant North Carolina State University January 5, 2017 Seth Sullivant (NCSU) Algebraic Statistics January 5, 2017 1 / 28 What is Algebraic Statistics? Observation
More informationToric Fiber Products
Toric Fiber Products Seth Sullivant North Carolina State University June 8, 2011 Seth Sullivant (NCSU) Toric Fiber Products June 8, 2011 1 / 26 Families of Ideals Parametrized by Graphs Let G be a finite
More informationPhylogenetic invariants versus classical phylogenetics
Phylogenetic invariants versus classical phylogenetics Marta Casanellas Rius (joint work with Jesús Fernández-Sánchez) Departament de Matemàtica Aplicada I Universitat Politècnica de Catalunya Algebraic
More informationmathematics Smoothness in Binomial Edge Ideals Article Hamid Damadi and Farhad Rahmati *
mathematics Article Smoothness in Binomial Edge Ideals Hamid Damadi and Farhad Rahmati * Faculty of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez
More informationUsing algebraic geometry for phylogenetic reconstruction
Using algebraic geometry for phylogenetic reconstruction Marta Casanellas i Rius (joint work with Jesús Fernández-Sánchez) Departament de Matemàtica Aplicada I Universitat Politècnica de Catalunya IMA
More informationTotal binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universität Magdeburg
Total binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universität Magdeburg Setup Let k be a field. For computations we use k = Q. k[p] := k[p 1,..., p n ] the polynomial ring in n indeterminates
More informationGeometry of Phylogenetic Inference
Geometry of Phylogenetic Inference Matilde Marcolli CS101: Mathematical and Computational Linguistics Winter 2015 References N. Eriksson, K. Ranestad, B. Sturmfels, S. Sullivant, Phylogenetic algebraic
More informationPRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM
PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM ALEX FINK 1. Introduction and background Consider the discrete conditional independence model M given by {X 1 X 2 X 3, X 1 X 3 X 2 }. The intersection axiom
More informationIdentifiability of the GTR+Γ substitution model (and other models) of DNA evolution
Identifiability of the GTR+Γ substitution model (and other models) of DNA evolution Elizabeth S. Allman Dept. of Mathematics and Statistics University of Alaska Fairbanks TM Current Challenges and Problems
More informationToric Varieties in Statistics
Toric Varieties in Statistics Daniel Irving Bernstein and Seth Sullivant North Carolina State University dibernst@ncsu.edu http://www4.ncsu.edu/~dibernst/ http://arxiv.org/abs/50.063 http://arxiv.org/abs/508.0546
More informationPHYLOGENETIC ALGEBRAIC GEOMETRY
PHYLOGENETIC ALGEBRAIC GEOMETRY NICHOLAS ERIKSSON, KRISTIAN RANESTAD, BERND STURMFELS, AND SETH SULLIVANT Abstract. Phylogenetic algebraic geometry is concerned with certain complex projective algebraic
More informationOpen Problems in Algebraic Statistics
Open Problems inalgebraic Statistics p. Open Problems in Algebraic Statistics BERND STURMFELS UNIVERSITY OF CALIFORNIA, BERKELEY and TECHNISCHE UNIVERSITÄT BERLIN Advertisement Oberwolfach Seminar Algebraic
More informationarxiv: v4 [math.ac] 31 May 2012
BETTI NUMBERS OF STANLEY-REISNER RINGS DETERMINE HIERARCHICAL MARKOV DEGREES SONJA PETROVIĆ AND ERIK STOKES arxiv:0910.1610v4 [math.ac] 31 May 2012 Abstract. There are two seemingly unrelated ideals associated
More informationMarkov bases and subbases for bounded contingency tables
Markov bases and subbases for bounded contingency tables arxiv:0905.4841v2 [math.co] 23 Jun 2009 Fabio Rapallo Abstract Ruriko Yoshida In this paper we study the computation of Markov bases for contingency
More informationThe binomial ideal of the intersection axiom for conditional probabilities
J Algebr Comb (2011) 33: 455 463 DOI 10.1007/s10801-010-0253-5 The binomial ideal of the intersection axiom for conditional probabilities Alex Fink Received: 10 February 2009 / Accepted: 27 August 2010
More informationVeronesean almost binomial almost complete intersections
Rend. Istit. Mat. Univ. Trieste Volume 50 (2018), 1 15 (electronic preview) DOI: 10.13137/0049-4704/21598 Veronesean almost binomial almost complete intersections Thomas Kahle and André Wagner Abstract.
More informationCommuting birth-and-death processes
Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop on Algebraic Statistics December 18, 2008 Birth-and-death
More informationMetric learning for phylogenetic invariants
Metric learning for phylogenetic invariants Nicholas Eriksson nke@stanford.edu Department of Statistics, Stanford University, Stanford, CA 94305-4065 Yuan Yao yuany@math.stanford.edu Department of Mathematics,
More informationSpecies Tree Inference using SVDquartets
Species Tree Inference using SVDquartets Laura Kubatko and Dave Swofford May 19, 2015 Laura Kubatko SVDquartets May 19, 2015 1 / 11 SVDquartets In this tutorial, we ll discuss several different data types:
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Markov Bases for Two-way Subtable Sum Problems
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Markov Bases for Two-way Subtable Sum Problems Hisayuki HARA, Akimichi TAKEMURA and Ruriko YOSHIDA METR 27 49 August 27 DEPARTMENT OF MATHEMATICAL INFORMATICS
More informationTutorial: Gaussian conditional independence and graphical models. Thomas Kahle Otto-von-Guericke Universität Magdeburg
Tutorial: Gaussian conditional independence and graphical models Thomas Kahle Otto-von-Guericke Universität Magdeburg The central dogma of algebraic statistics Statistical models are varieties The central
More informationarxiv: v1 [q-bio.pe] 23 Nov 2017
DIMENSIONS OF GROUP-BASED PHYLOGENETIC MIXTURES arxiv:1711.08686v1 [q-bio.pe] 23 Nov 2017 HECTOR BAÑOS, NATHANIEL BUSHEK, RUTH DAVIDSON, ELIZABETH GROSS, PAMELA E. HARRIS, ROBERT KRONE, COLBY LONG, ALLEN
More informationBinomial Exercises A = 1 1 and 1
Lecture I. Toric ideals. Exhibit a point configuration A whose affine semigroup NA does not consist of the intersection of the lattice ZA spanned by the columns of A with the real cone generated by A.
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals
Binomial Ideals Binomial ideals offer an interesting class of examples. Because they occur so frequently in various applications, the development methods for binomial ideals is justified. 1 Binomial Ideals
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 informationarxiv: v2 [math.ac] 15 May 2010
MARKOV DEGREES OF HIERARCHICAL MODELS DETERMINED BY BETTI NUMBERS OF STANLEY-REISNER IDEALS SONJA PETROVIĆ AND ERIK STOKES arxiv:0910.1610v2 [math.ac] 15 May 2010 Abstract. There are two seemingly unrelated
More informationAlgebraic Invariants of Phylogenetic Trees
Harvey Mudd College November 21st, 2006 The Problem DNA Sequence Data Given a set of aligned DNA sequences... Human: A G A C G T T A C G T A... Chimp: A G A G C A A C T T T G... Monkey: A A A C G A T A
More informationThe Maximum Likelihood Threshold of a Graph
The Maximum Likelihood Threshold of a Graph Elizabeth Gross and Seth Sullivant San Jose State University, North Carolina State University August 28, 2014 Seth Sullivant (NCSU) Maximum Likelihood Threshold
More informationSome Algebraic and Combinatorial Properties of the Complete T -Partite Graphs
Iranian Journal of Mathematical Sciences and Informatics Vol. 13, No. 1 (2018), pp 131-138 DOI: 10.7508/ijmsi.2018.1.012 Some Algebraic and Combinatorial Properties of the Complete T -Partite Graphs Seyyede
More informationLecture 1. Toric Varieties: Basics
Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture
More informationToric ideals finitely generated up to symmetry
Toric ideals finitely generated up to symmetry Anton Leykin Georgia Tech MOCCA, Levico Terme, September 2014 based on [arxiv:1306.0828] Noetherianity for infinite-dimensional toric varieties (with Jan
More informationAlgebraic Varieties. Notes by Mateusz Micha lek for the lecture on April 17, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra
Algebraic Varieties Notes by Mateusz Micha lek for the lecture on April 17, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra Algebraic varieties represent solutions of a system of polynomial
More informationDistance-reducing Markov bases for sampling from a discrete sample space
Bernoulli 11(5), 2005, 793 813 Distance-reducing Markov bases for sampling from a discrete sample space AKIMICHI TAKEMURA* and SATOSHI AOKI** Department of Mathematical Informatics, Graduate School of
More informationIs Every Secant Variety of a Segre Product Arithmetically Cohen Macaulay? Oeding (Auburn) acm Secants March 6, / 23
Is Every Secant Variety of a Segre Product Arithmetically Cohen Macaulay? Luke Oeding Auburn University Oeding (Auburn) acm Secants March 6, 2016 1 / 23 Secant varieties and tensors Let V 1,..., V d, be
More informationALGEBRA: From Linear to Non-Linear. Bernd Sturmfels University of California at Berkeley
ALGEBRA: From Linear to Non-Linear Bernd Sturmfels University of California at Berkeley John von Neumann Lecture, SIAM Annual Meeting, Pittsburgh, July 13, 2010 Undergraduate Linear Algebra All undergraduate
More informationCombinatorics and geometry of E 7
Combinatorics and geometry of E 7 Steven Sam University of California, Berkeley September 19, 2012 1/24 Outline Macdonald representations Vinberg representations Root system Weyl group 7 points in P 2
More informationHILBERT BASIS OF THE LIPMAN SEMIGROUP
Available at: http://publications.ictp.it IC/2010/061 United Nations Educational, Scientific and Cultural Organization and International Atomic Energy Agency THE ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL
More informationToric statistical models: parametric and binomial representations
AISM (2007) 59:727 740 DOI 10.1007/s10463-006-0079-z Toric statistical models: parametric and binomial representations Fabio Rapallo Received: 21 February 2005 / Revised: 1 June 2006 / Published online:
More informationJed Chou. April 13, 2015
of of CS598 AGB April 13, 2015 Overview of 1 2 3 4 5 Competing Approaches of Two competing approaches to species tree inference: Summary methods: estimate a tree on each gene alignment then combine gene
More informationUndirected Graphical Models
Undirected Graphical Models 1 Conditional Independence Graphs Let G = (V, E) be an undirected graph with vertex set V and edge set E, and let A, B, and C be subsets of vertices. We say that C separates
More informationUSING INVARIANTS FOR PHYLOGENETIC TREE CONSTRUCTION
USING INVARIANTS FOR PHYLOGENETIC TREE CONSTRUCTION NICHOLAS ERIKSSON Abstract. Phylogenetic invariants are certain polynomials in the joint probability distribution of a Markov model on a phylogenetic
More informationAlgebraic Complexity in Statistics using Combinatorial and Tensor Methods
Algebraic Complexity in Statistics using Combinatorial and Tensor Methods BY ELIZABETH GROSS THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics
More informationIndispensable monomials of toric ideals and Markov bases
Journal of Symbolic Computation 43 (2008) 490 507 www.elsevier.com/locate/jsc Indispensable monomials of toric ideals and Markov bases Satoshi Aoki a, Akimichi Takemura b, Ruriko Yoshida c a Department
More informationELIZABETH S. ALLMAN and JOHN A. RHODES ABSTRACT 1. INTRODUCTION
JOURNAL OF COMPUTATIONAL BIOLOGY Volume 13, Number 5, 2006 Mary Ann Liebert, Inc. Pp. 1101 1113 The Identifiability of Tree Topology for Phylogenetic Models, Including Covarion and Mixture Models ELIZABETH
More informationMinimal basis for connected Markov chain over 3 3 K contingency tables with fixed two-dimensional marginals. Satoshi AOKI and Akimichi TAKEMURA
Minimal basis for connected Markov chain over 3 3 K contingency tables with fixed two-dimensional marginals Satoshi AOKI and Akimichi TAKEMURA Graduate School of Information Science and Technology University
More informationPhylogeny of Mixture Models
Phylogeny of Mixture Models Daniel Štefankovič Department of Computer Science University of Rochester joint work with Eric Vigoda College of Computing Georgia Institute of Technology Outline Introduction
More information5. Grassmannians and the Space of Trees In this lecture we shall be interested in a very particular ideal. The ambient polynomial ring C[p] has ( n
5. Grassmannians and the Space of Trees In this lecture we shall be interested in a very particular ideal. The ambient polynomial ring C[p] has ( n d) variables, which are called Plücker coordinates: C[p]
More informationHomotopy Techniques for Tensor Decomposition and Perfect Identifiability
Homotopy Techniques for Tensor Decomposition and Perfect Identifiability Luke Oeding Auburn University with Hauenstein (Notre Dame), Ottaviani (Firenze) and Sommese (Notre Dame) Oeding (Auburn) Homotopy
More informationOn a perturbation method for determining group of invariance of hierarchical models
.... On a perturbation method for determining group of invariance of hierarchical models Tomonari SEI 1 Satoshi AOKI 2 Akimichi TAKEMURA 1 1 University of Tokyo 2 Kagoshima University Dec. 16, 2008 T.
More information19 Tree Construction using Singular Value Decomposition
19 Tree Construction using Singular Value Decomposition Nicholas Eriksson We present a new, statistically consistent algorithm for phylogenetic tree construction that uses the algeraic theory of statistical
More informationNoetherianity up to symmetry
1 Noetherianity up to symmetry Jan Draisma TU Eindhoven and VU Amsterdam Singular Landscapes in honour of Bernard Teissier Aussois, June 2015 A landscape, and a disclaimer 2 # participants A landscape,
More informationMaximum Likelihood Estimates for Binary Random Variables on Trees via Phylogenetic Ideals
Maximum Likelihood Estimates for Binary Random Variables on Trees via Phylogenetic Ideals Robin Evans Abstract In their 2007 paper, E.S. Allman and J.A. Rhodes characterise the phylogenetic ideal of general
More informationINITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F
INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY BOYAN JONOV Abstract. We show in this paper that the principal component of the first order jet scheme over the classical determinantal
More informationarxiv: v1 [q-bio.pe] 27 Oct 2011
INVARIANT BASED QUARTET PUZZLING JOE RUSINKO AND BRIAN HIPP arxiv:1110.6194v1 [q-bio.pe] 27 Oct 2011 Abstract. Traditional Quartet Puzzling algorithms use maximum likelihood methods to reconstruct quartet
More informationCombinatorics for algebraic geometers
Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is
More informationAcyclic Digraphs arising from Complete Intersections
Acyclic Digraphs arising from Complete Intersections Walter D. Morris, Jr. George Mason University wmorris@gmu.edu July 8, 2016 Abstract We call a directed acyclic graph a CI-digraph if a certain affine
More informationGeometry of Gaussoids
Geometry of Gaussoids Bernd Sturmfels MPI Leipzig and UC Berkeley p 3 p 13 p 23 a 12 3 p 123 a 23 a 13 2 a 23 1 a 13 p 2 p 12 a 12 p p 1 Figure 1: With The vertices Tobias andboege, 2-faces ofalessio the
More informationToric Varieties. Madeline Brandt. April 26, 2017
Toric Varieties Madeline Brandt April 26, 2017 Last week we saw that we can define normal toric varieties from the data of a fan in a lattice. Today I will review this idea, and also explain how they can
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More informationOn the extremal Betti numbers of binomial edge ideals of block graphs
On the extremal Betti numbers of binomial edge ideals of block graphs Jürgen Herzog Fachbereich Mathematik Universität Duisburg-Essen Essen, Germany juergen.herzog@uni-essen.de Giancarlo Rinaldo Department
More informationThe intersection axiom of
The intersection axiom of conditional independence: some new [?] results Richard D. Gill Mathematical Institute, University Leiden This version: 26 March, 2019 (X Y Z) & (X Z Y) X (Y, Z) Presented at Algebraic
More informationReconstruire le passé biologique modèles, méthodes, performances, limites
Reconstruire le passé biologique modèles, méthodes, performances, limites Olivier Gascuel Centre de Bioinformatique, Biostatistique et Biologie Intégrative C3BI USR 3756 Institut Pasteur & CNRS Reconstruire
More informationDISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS
DISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS AARON ABRAMS, DAVID GAY, AND VALERIE HOWER Abstract. We show that the discretized configuration space of k points in the n-simplex is homotopy equivalent
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 informationRigid monomial ideals
Rigid monomial ideals Timothy B.P. Clark and Sonja Mapes February 10, 011 Abstract In this paper we investigate the class of rigid monomial ideals. We give a characterization of the minimal free resolutions
More informationTropical decomposition of symmetric tensors
Tropical decomposition of symmetric tensors Melody Chan University of California, Berkeley mtchan@math.berkeley.edu December 11, 008 1 Introduction In [], Comon et al. give an algorithm for decomposing
More informationAlgebraic Classification of Small Bayesian Networks
GROSTAT VI, Menton IUT STID p. 1 Algebraic Classification of Small Bayesian Networks Luis David Garcia, Michael Stillman, and Bernd Sturmfels lgarcia@math.vt.edu Virginia Tech GROSTAT VI, Menton IUT STID
More informationPitfalls of Heterogeneous Processes for Phylogenetic Reconstruction
Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction Daniel Štefankovič Eric Vigoda June 30, 2006 Department of Computer Science, University of Rochester, Rochester, NY 14627, and Comenius
More informationWhen Do Phylogenetic Mixture Models Mimic Other Phylogenetic Models?
Syst. Biol. 61(6):1049 1059, 2012 The Author(s) 2012. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com
More informationThe combinatorics of binomial ideals
The combinatorics of binomial ideals Thomas Kahle (MSRI) (joint with Ezra Miller, Duke) December 6, 2012 No Theorem Let k be a field. Every binomial ideal in k[x 1,..., x n ] is an intersection of primary
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 Recitation 3 1 Gaussian Graphical Models: Schur s Complement Consider
More informationarxiv: v1 [math.ra] 13 Jan 2009
A CONCISE PROOF OF KRUSKAL S THEOREM ON TENSOR DECOMPOSITION arxiv:0901.1796v1 [math.ra] 13 Jan 2009 JOHN A. RHODES Abstract. A theorem of J. Kruskal from 1977, motivated by a latent-class statistical
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 informationIntroduction to Groups
Introduction to Groups S F Ellermeyer November 2, 2006 A group, G, is a set, A, endowed with a single binary operation,, such that: The operation is associative, meaning that a (b c) = (a b) c for all
More informationEvaluate algebraic expressions for given values of the variables.
Algebra I Unit Lesson Title Lesson Objectives 1 FOUNDATIONS OF ALGEBRA Variables and Expressions Exponents and Order of Operations Identify a variable expression and its components: variable, coefficient,
More informationON CERTAIN CLASSES OF CURVE SINGULARITIES WITH REDUCED TANGENT CONE
ON CERTAIN CLASSES OF CURVE SINGULARITIES WITH REDUCED TANGENT CONE Alessandro De Paris Università degli studi di Napoli Federico II Dipartimento di Matematica e Applicazioni R. Caccioppoli Complesso Monte
More informationCOMBINATORIAL SYMBOLIC POWERS. 1. Introduction The r-th symbolic power of an ideal I in a Notherian ring R is the ideal I (r) := R 1
COMBINATORIAL SYMBOLIC POWERS SETH SULLIVANT arxiv:math/0608542v1 [mathac] 22 Aug 2006 Abstract Symbolic powers of ideals are studied in the combinatorial context of monomial ideals When the ideals are
More informationBoij-Söderberg Theory
? September 16, 2013 Table of contents? 1? 2 3 4 5 6 Preface? In this presentation we try to give an outline on a new theory on free resolutions. This theory is named after two Swedish mathematicians Mats
More informationBetti Numbers of Splittable Graphs
Betti Numbers of Splittable Graphs Brittany Burns Dept. of Mathematical Sciences Shawnee State University, Portsmouth, OH 45662 USA Haley Mansfield Dept. of Mathematics Kansas State University, Manhattan,
More informationarxiv: v1 [math.ac] 31 Oct 2015
MESOPRIMARY DECOMPOSITION OF BINOMIAL SUBMODULES CHRISTOPHER O NEILL arxiv:1511.00161v1 [math.ac] 31 Oct 2015 Abstract. Recent results of Kahle and Miller give a method of constructing primary decompositions
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationNonlinear Discrete Optimization
Nonlinear Discrete Optimization Technion Israel Institute of Technology http://ie.technion.ac.il/~onn Billerafest 2008 - conference in honor of Lou Billera's 65th birthday (Update on Lecture Series given
More informationarxiv:math/ v1 [math.st] 23 May 2006
The Annals of Statistics 2006, Vol. 34, No. 1, 523 545 DOI: 10.1214/009053605000000822 c Institute of Mathematical Statistics, 2006 arxiv:math/0605615v1 [math.st] 23 May 2006 SEQUENTIAL IMPORTANCE SAMPLING
More informationPolytopes and Algebraic Geometry. Jesús A. De Loera University of California, Davis
Polytopes and Algebraic Geometry Jesús A. De Loera University of California, Davis Outline of the talk 1. Four classic results relating polytopes and algebraic geometry: (A) Toric Geometry (B) Viro s Theorem
More informationPitfalls of Heterogeneous Processes for Phylogenetic Reconstruction
Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction DANIEL ŠTEFANKOVIČ 1 AND ERIC VIGODA 2 1 Department of Computer Science, University of Rochester, Rochester, New York 14627, USA; and
More informationarxiv: v1 [math.co] 10 Aug 2016
POLYTOPES OF STOCHASTIC TENSORS HAIXIA CHANG 1, VEHBI E. PAKSOY 2 AND FUZHEN ZHANG 2 arxiv:1608.03203v1 [math.co] 10 Aug 2016 Abstract. Considering n n n stochastic tensors (a ijk ) (i.e., nonnegative
More informationarxiv: v2 [math.ac] 17 Apr 2013
ALGEBRAIC PROPERTIES OF CLASSES OF PATH IDEALS MARTINA KUBITZKE AND ANDA OLTEANU arxiv:1303.4234v2 [math.ac] 17 Apr 2013 Abstract. We consider path ideals associated to special classes of posets such as
More informationALGEBRAIC AND COMBINATORIAL PROPERTIES OF CERTAIN TORIC IDEALS IN THEORY AND APPLICATIONS
University of Kentucky UKnowledge University of Kentucky Doctoral Dissertations Graduate School 2008 ALGEBRAIC AND COMBINATORIAL PROPERTIES OF CERTAIN TORIC IDEALS IN THEORY AND APPLICATIONS Sonja Petrovic
More informationProblems on Minkowski sums of convex lattice polytopes
arxiv:08121418v1 [mathag] 8 Dec 2008 Problems on Minkowski sums of convex lattice polytopes Tadao Oda odatadao@mathtohokuacjp Abstract submitted at the Oberwolfach Conference Combinatorial Convexity and
More informationACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS
ACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS WALTER D. MORRIS, JR. ABSTRACT. We call a directed acyclic graph a CIdigraph if a certain affine semigroup ring defined by it is a complete intersection.
More informationA Survey of Parking Functions
A Survey of Parking Functions Richard P. Stanley M.I.T. Parking functions... n 2 1... a a a 1 2 n Car C i prefers space a i. If a i is occupied, then C i takes the next available space. We call (a 1,...,a
More informationLOVÁSZ-SAKS-SCHRIJVER IDEALS AND COORDINATE SECTIONS OF DETERMINANTAL VARIETIES
LOVÁSZ-SAKS-SCHRIJVER IDEALS AND COORDINATE SECTIONS OF DETERMINANTAL VARIETIES ALDO CONCA AND VOLKMAR WELKER Abstract Motivated by questions in algebra and combinatorics we study two ideals associated
More information1 Adjacency matrix and eigenvalues
CSC 5170: Theory of Computational Complexity Lecture 7 The Chinese University of Hong Kong 1 March 2010 Our objective of study today is the random walk algorithm for deciding if two vertices in an undirected
More informationAn introduction to Hodge algebras
An introduction to Hodge algebras Federico Galetto May 28, 2009 The Grassmannian Let k be a field, E a k-vector space of dimension m Define Grass(n, E) := {V E dim V = n} If {e 1,, e m } is a basis of
More informationMixed-up Trees: the Structure of Phylogenetic Mixtures
Bulletin of Mathematical Biology (2008) 70: 1115 1139 DOI 10.1007/s11538-007-9293-y ORIGINAL ARTICLE Mixed-up Trees: the Structure of Phylogenetic Mixtures Frederick A. Matsen a,, Elchanan Mossel b, Mike
More informationExterior powers and Clifford algebras
10 Exterior powers and Clifford algebras In this chapter, various algebraic constructions (exterior products and Clifford algebras) are used to embed some geometries related to projective and polar spaces
More informationIdeals and graphs, Gröbner bases and decision procedures in graphs
Ideals and graphs, Gröbner bases and decision procedures in graphs GIUSEPPA CARRA FERRO and DANIELA FERRARELLO Department of Mathematics and Computer Science University of Catania Viale Andrea Doria 6,
More information