The Maximum Likelihood Threshold of a Graph
|
|
- Ernest Blake
- 5 years ago
- Views:
Transcription
1 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 August 28, / 25
2 Gaussian Graphical Models S m = set of m m symmetric real matrices S m >0 S m 0 positive definite matrices in Sm positive semidefinite matrices in Sm Let G = (V, E) be an undirected graph, V = m. Definition M G = {Σ S m >0 : (Σ 1 ) ij = 0 for all i, j s.t. i j, ij / E} The centered Gaussian graphical model associated to the graph G consists of all multivariate normal distributions N (0, Σ) such that Σ M G. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
3 Sufficient Statistics Let φ G : S m R V +E φ G (Σ) = (σ ii ) i V (σ ij ) ij E For data X 1,..., X n R m, let S = 1 n n i=1 X ixi T covariance matrix. be the sample Proposition The minimal sufficient statistics of M G are φ G (S). The set φ G (S m 0 ) = K G is the cone of sufficient statistics. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
4 Maximum Likelihood Estimation in GGMs Theorem GGM M G is a regular exponential family. For sufficient statistics φ G (S), the likelihood function is convex, with at most one local maximum. If maximum likelihood estimate exists, it is the unique solution to the equation φ G (S) = φ G (Σ) subject to Σ M G. For a given sample covariance matrix S, the maximum likelihood estimate exists if and only if there exists Σ S m >0 such that φ G (S) = φ G (Σ). Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
5 The Maximum Likelihood Threshold Note if n m then generically S = 1 n n i=1 X ixi T is positive definite. MLE exists almost surely (since φ G (S) = φ G (S)). What happens when n < m? Definition Let G = ([m], E). Smallest n such that for almost all S S m 0 with rank S = n, there exist Σ S m >0 such that φ G(S) = φ G (Σ) is called the maximum likelihood threshold of G. Denoted: mlt(g) n mlt(g) means MLE exists almost surely for n data points. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
6 Work of Ben-David Definition (Ben-David 2014) The Gaussian rank of a graph is the smallest n such that for all general position rank n matrices S in S m 0, there exist Σ Sm >0 such that φ G (S) = φ G (Σ). A general position positive semidefinite matrix S is one where if S = L T L then every n n submatrix of L is invertible. Both maximum likelihood threshold and gaussian rank ask for this condition to hold on a dense open subset. In gaussian rank, we explicitly specify which open subset to look at. Thus mlt(g) gaussrank(g). Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
7 Basic Facts Clique number: ω(g) = size of a largest clique of G. A chordal graph is a graph with no induced cycle of length 4. A chordal cover of G = (V, E) is a graph H = (V, E ) such H is chordal and E E. Tree Width: τ(g) = min{ω(h) 1 : H chordal cover of G} Proposition Let G H. Then mlt(g) mlt(h). If G is chordal then mlt(g) = ω(g). Arbitrary G: ω(g) mlt(g) τ(g) + 1. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
8 Basic Facts Note that the bounds ω(g) mlt(g) τ(g) + 1. are far from each other in many situations. Proposition [Buhl 1993] For m-cycle C m mlt(c m ) = 3. mlt(g) = 1 if and only if G has no edges. mlt(g) = 2 if and only if G has no cycles. mlt(g) = m if and only if G = K m. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
9 Other Ways To Think About mlt(g) Instead of computing S = 1 n n i=1 X ixi T take p 1,..., p m R n and let S ij = p i p j. Problem For each graph G, what is the smallest n such that for almost all P = (p 1,..., p m ) R n m there exists a set of linearly independent vectors P = (q 1,..., q m ) R m m such that p i 2 = q i 2 for all i, and p i p j = q i q j for all ij E? We can assume all p i 2 = 1, i.e. all p i are confined to sphere. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
10 The Cycle Proposition (Buhl 1993) If C m is a cycle then mlt(c m ) = 3. Proof. τ(c m ) = 2, so mlt(c m ) 3. mlt(c m ) > 2, since there are non-liftable embeddings on the circle Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
11 Yet another way to think about mlt(g) K G := φ G (S m 0 ) is the cone of sufficient statistics. For a given S S m 0 the maximum likelihood estimate exists if and only if φ G (S) int(k G ). Let S(m, n) = {Σ R m m : Σ = Σ T, rank(σ) n}. Proposition If mlt(g) > n then φ G (S(m, n)) is contained in the Zariski closure of the boundary of K G. Definition Minimal n such that dim φ G (S(m, n)) = dim K G = V + E is rank(g). Corollary (Uhler 2012) mlt(g) rank(g). Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
12 Algebraic Matroids Definition Let I K[x 1,..., x n ] be a prime ideal. This defines an algebraic matroid with ground set {x 1,..., x n }, and K {x 1,..., x n } an independent set if and only if I K[K ] = 0. Corollary (Uhler 2012) Let I n K[σ ij : 1 i j m] be the ideal of n n minors of an m m symmetric matrix Σ. Let G = (V, E) be a graph. If {σ ii : i [m]} {σ ij : ij E} is an independent set in the algebraic matroid associated to I n+1 then mlt(g) n. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
13 Combinatorial Rigidity Theory Consider the map ψ n : R n m R m(m 1)/2 (p 1,..., p m ) ( p i p j 2 2 : 1 i < j m) Let J n = I(im(ψ n )) K[x ij : 1 i < j m]. The resulting matroid A(n) is the n-dimensional generic rigidity matroid. Spanning sets in the matroid are called (generically infinitesimally) rigid graphs. Bases in the matroid are called (generically) isostatic graphs. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
14 Laman s Theorem To be a spanning set in A(n) must have nm ( ) n+1 2 E. Conversely, to be independent must have nm ( ) n+1 2 E. Theorem (Laman 1970) A graph G = (V, E) is isostatic in the rigidity matroid A(2) if and only if E = 2m 3, and For every induced subgraph G W = (W, E W ), E W 2 W 3. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
15 Rigidity Matroid = Symmetric Minor Matroid Theorem (Gross-S 2014) Proof. A graph G = (V, E) has rank(g) = n if and only E is an independent set in A(n 1) and not an independent set in A(n 2). The matroid A(n 1) is isomorphic to the contraction of the rank n symmetric minor matroid via the diagonal elements. Compare the Jacobian of the map to the Jacobian of the map (p 1,..., p m ) ( p i p j 2 2 : 1 i < j m) (p 1,..., p m ) (p i p j : 1 i j m). Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
16 Applications of Rigidity Theory Definition Let G be a graph, and r N. The r-core of G is the graph obtained by successively removing vertices of G of degree < r. Theorem (Ben-David 2014, Gross-S 2014) If mlt(core r (G)) r then mlt(g) r. Example (Grid Graphs) mlt(gr k1,k 2 ) = 3, but τ(gr k1,k 2 ) + 1 = min(k 1, k 2 ) + 1. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
17 Planar Graphs Theorem If G is a planar graph then mlt(g) 4. Proof. Cauchy s theorem implies that every edge graph of a simplicial 3-polytope is rigid. Edge count = G isostatic = rank(g) 4. Every planar graph is a subgraph of graph of a simplicial 3-polytope. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
18 Splitting Theorem Theorem (Splitting Theorem) Let G be a graph, r 1,..., r k integers and V 1,..., V k a partition of the vertices of G, such that 1 for all i, rank(g Vi ) r i and 2 for all i j, (r i, r j ) birank(g(v i, V j )). Then rank(g) r r k. Proof idea: Decompose R r 1+ +r k = R r 1 R r k for i V j let p i = (0, 0,..., 0, q }{{} i, 0,..., 0) jth spot Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
19 Cycle-Free Coloring Corollary Let G be a graph and V 1,..., V k be a partition of the vertices of G such that 1 for all i, V i is an independent set of G and 2 for all i j, G(V i, V j ) has no cycles. Then rank(g) k. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
20 Weak Maximum Likelihood Threshold Definition For each graph G, the weak maximum likelihood threshold, wmlt(g), is the smallest n such that there exists a Σ 0 Sym(m, n) S m 0 and a Σ S m >0 such that φ G(Σ 0 ) = φ G (Σ). In other words, MLE exists with probability > 0. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
21 Splitting Lemma (Splitting Lemma) Let G be a graph, r 1,..., r k integers and V 1,..., V k a partition of the vertices of G, such that for all i, wmlt(g Vi ) r i. Then wmlt(g) r r k. Corollary Let G be a graph. Then wmlt(g) χ(g). Corollary Let G be a nonempty bipartite graph. Then wmlt(g) = 2. Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
22 Buhl s Cycle Condition Proposition Let G = ([m], E) be a graph with wmlt(g) = 2. Then 1 G is triangle-free and 2 there exists a cyclic order w = w 1 w 2 w m of the vertices of G that puts every cycle of G in the wrong cyclic order. Question Does every triangle free graph have a cycle disruptive ordering of its vertices? Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
23 More Stuff We Don t Know Find an example of a graph where mlt(g) < rank(g). e.g. A graph where dim φ G (S(m, n)) V + E but φ G (S(m, n) S m 0 ) is not in the algebraic boundary of K G. How are boundary components of K G related to circuits in the rigidity matroid? Maximum likelihood threshold has a natural rigidity theory analogue: are they equivalent? Weak maximum likelihood threshold has a natural rigidity theory analogue: are they equivalent? Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
24 Summary and Conclusions The maximum likelihood threshold bounds the amount of data needed to guarantee the maximum likelihood estimate exists for a given Gaussian graphical model. Result of Uhler connects mlt(g) to algebraic matroids. We connect the symmetric minor matroid to the rigidity matroid. We use results from rigidity theory to get new bounds on mlt(g). Many open problems remain! Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
25 References E. Ben-David. Sharper lower and upper bounds for the gaussian rank of a graph. (2014) ArXiv: S. Buhl. On the existence of maximum likelihood estimators for graphical Gaussian models. Scand. J. Statist. 20 (1993), no. 3, J. Graver, B. Servatius, and H. Servatius. Combinatorial Rigidity. Graduate Studies in Mathematics, Vol. 2. American Mathematical Society, E. Gross and S. Sullivant. The maximum likelihood threshold of a graph. (2014) ArXiv: G. Kalai, E. Nevo, I. Novik. Bipartite rigidity. (2013) ArXiv: G. Laman. On graphs and the rigidity of plane skeletal structures, J. Engineering Mathematics 4 (1970): C. Uhler. Geometry of maximum likelihood estimation in Gaussian graphical models. Ann. Statist. 40 (2012), no. 1, Seth Sullivant (NCSU) Maximum Likelihood Threshold August 28, / 25
Likelihood Analysis of Gaussian Graphical Models
Faculty of Science Likelihood Analysis of Gaussian Graphical Models Ste en Lauritzen Department of Mathematical Sciences Minikurs TUM 2016 Lecture 2 Slide 1/43 Overview of lectures Lecture 1 Markov Properties
More informationAn Algebraic and Geometric Perspective on Exponential Families
An Algebraic and Geometric Perspective on Exponential Families Caroline Uhler (IST Austria) Based on two papers: with Mateusz Micha lek, Bernd Sturmfels, and Piotr Zwiernik, and with Liam Solus and Ruriko
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationThe Geometry of Semidefinite Programming. Bernd Sturmfels UC Berkeley
The Geometry of Semidefinite Programming Bernd Sturmfels UC Berkeley Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent: All n eigenvalues of A are positive real
More informationALGEBRAIC GEOMETRY I - FINAL PROJECT
ALGEBRAIC GEOMETRY I - FINAL PROJECT ADAM KAYE Abstract This paper begins with a description of the Schubert varieties of a Grassmannian variety Gr(k, n) over C Following the technique of Ryan [3] for
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 informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
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 informationPeter J. Dukes. 22 August, 2012
22 August, 22 Graph decomposition Let G and H be graphs on m n vertices. A decompostion of G into copies of H is a collection {H i } of subgraphs of G such that each H i = H, and every edge of G belongs
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 informationGaussian Graphical Models: An Algebraic and Geometric Perspective
Gaussian Graphical Models: An Algebraic and Geometric Perspective Caroline Uhler arxiv:707.04345v [math.st] 3 Jul 07 Abstract Gaussian graphical models are used throughout the natural sciences, social
More informationMultivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
Ann Inst Stat Math (2010) 62:603 638 DOI 10.1007/s10463-010-0295-4 Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry Bernd Sturmfels Caroline Uhler Received: 15 June
More informationSpanning Trees of Shifted Simplicial Complexes
Art Duval (University of Texas at El Paso) Caroline Klivans (Brown University) Jeremy Martin (University of Kansas) Special Session on Extremal and Probabilistic Combinatorics University of Nebraska, Lincoln
More informationGraphical Gaussian models and their groups
Piotr Zwiernik TU Eindhoven (j.w. Jan Draisma, Sonja Kuhnt) Workshop on Graphical Models, Fields Institute, Toronto, 16 Apr 2012 1 / 23 Outline and references Outline: 1. Invariance of statistical models
More informationTopics in Graph Theory
Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End
More informationAn Introduction to the Rigidity Theory of Bar and Joint Frameworks
An Introduction to the Rigidity Theory of Bar and Joint Frameworks James Cruickshank NUI Galway April 11, 2013 Frameworks An n-dimensional (abstract) bar and joint framework is a pair (G, ρ) where G =
More informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationHOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID?
HOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID? RAUL CORDOVIL, DAVID FORGE AND SULAMITA KLEIN To the memory of Claude Berge Abstract. Let G be a finite simple graph. From the pioneering work
More informationACO Comprehensive Exam October 14 and 15, 2013
1. Computability, Complexity and Algorithms (a) Let G be the complete graph on n vertices, and let c : V (G) V (G) [0, ) be a symmetric cost function. Consider the following closest point heuristic for
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationRigidity of Graphs and Frameworks
Rigidity of Graphs and Frameworks Rigid Frameworks The Rigidity Matrix and the Rigidity Matroid Infinitesimally Rigid Frameworks Rigid Graphs Rigidity in R d, d = 1,2 Global Rigidity in R d, d = 1,2 1
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 informationHOMEWORK #2 - MATH 3260
HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is
More informationPOSITIVE SEMIDEFINITE ZERO FORCING
December 12, 2011 POSITIVE SEMIDEFINITE ZERO FORCING JASON EKSTRAND, CRAIG ERICKSON, H. TRACY HALL, DIANA HAY, LESLIE HOGBEN, RYAN JOHNSON, NICOLE KINGSLEY, STEVEN OSBORNE, TRAVIS PETERS, JOLIE ROAT, ARIANNE
More informationarxiv: v1 [math.co] 21 Sep 2017
Chromatic number, Clique number, and Lovász s bound: In a comparison Hamid Reza Daneshpajouh a,1 a School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran, P.O. Box 19395-5746
More informationACO Comprehensive Exam October 18 and 19, Analysis of Algorithms
Consider the following two graph problems: 1. Analysis of Algorithms Graph coloring: Given a graph G = (V,E) and an integer c 0, a c-coloring is a function f : V {1,,...,c} such that f(u) f(v) for all
More informationThe Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs. Mark C. Kempton
The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs Mark C. Kempton A thesis submitted to the faculty of Brigham Young University in partial fulfillment of the requirements for
More informationCombining the cycle index and the Tutte polynomial?
Combining the cycle index and the Tutte polynomial? Peter J. Cameron University of St Andrews Combinatorics Seminar University of Vienna 23 March 2017 Selections Students often meet the following table
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 informationPOSITIVE SEMIDEFINITE ZERO FORCING
May 17, 2011 POSITIVE SEMIDEFINITE ZERO FORCING JASON EKSTRAND, CRAIG ERICKSON, H. TRACY HALL, DIANA HAY, LESLIE HOGBEN, RYAN JOHNSON, NICOLE KINGSLEY, STEVEN OSBORNE, TRAVIS PETERS, JOLIE ROAT, ARIANNE
More informationHodge theory for combinatorial geometries
Hodge theory for combinatorial geometries June Huh with Karim Adiprasito and Eric Katz June Huh 1 / 48 Three fundamental ideas: June Huh 2 / 48 Three fundamental ideas: The idea of Bernd Sturmfels that
More informationA Colin de Verdiere-Type Invariant and Odd-K 4 - and Odd-K3 2 -Free Signed Graphs
A Colin de Verdiere-Type Invariant and Odd-K 4 - and Odd-K3 2 -Free Signed Graphs Hein van der Holst Georgia State University Conference honouring Robin s 50th birthday Joint work with Marina Arav, Frank
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 informationGorenstein rings through face rings of manifolds.
Gorenstein rings through face rings of manifolds. Isabella Novik Department of Mathematics, Box 354350 University of Washington, Seattle, WA 98195-4350, USA, novik@math.washington.edu Ed Swartz Department
More informationTotal positivity in Markov structures
1 based on joint work with Shaun Fallat, Kayvan Sadeghi, Caroline Uhler, Nanny Wermuth, and Piotr Zwiernik (arxiv:1510.01290) Faculty of Science Total positivity in Markov structures Steffen Lauritzen
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 3398 303 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Maximal cliques in {P 2 P 3, C }-free graphs S.A.
More informationChordal Graphs, Interval Graphs, and wqo
Chordal Graphs, Interval Graphs, and wqo Guoli Ding DEPARTMENT OF MATHEMATICS LOUISIANA STATE UNIVERSITY BATON ROUGE, LA 70803-4918 E-mail: ding@math.lsu.edu Received July 29, 1997 Abstract: Let be the
More informationBounded Treewidth Graphs A Survey German Russian Winter School St. Petersburg, Russia
Bounded Treewidth Graphs A Survey German Russian Winter School St. Petersburg, Russia Andreas Krause krausea@cs.tum.edu Technical University of Munich February 12, 2003 This survey gives an introduction
More informationarxiv: v1 [math.st] 14 May 2018
THE MAXIMUM LIKELIHOOD THRESHOLD OF A PATH DIAGRAM arxiv:805.05485v [math.st] 4 May 208 By Mathias Drton, Christopher Fox, Andreas Käufl and Guillaume Pouliot University of Washington, University of Chicago,
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 informationRigidity of Graphs and Frameworks
School of Mathematical Sciences Queen Mary, University of London England DIMACS, 26-29 July, 2016 Bar-and-Joint Frameworks A d-dimensional bar-and-joint framework is a pair (G, p), where G = (V, E) is
More informationCombinatorial symbolic powers
Journal of Algebra 319 2008) 115 142 wwwelseviercom/locate/jalgebra Combinatorial symbolic powers Seth Sullivant Department of Mathematics and Society of Fellows, Harvard University, Cambridge, MA 02138,
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 informationPolyhedral Conditions for the Nonexistence of the MLE for Hierarchical Log-linear Models
Polyhedral Conditions for the Nonexistence of the MLE for Hierarchical Log-linear Models Nicholas Eriksson Department of Mathematics University of California, Berkeley Alessandro Rinaldo Department of
More informationUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems Jan van den Heuvel and Snežana Pejić Department of Mathematics London School of Economics Houghton Street,
More informationBrigitte Servatius and Herman Servatius. Department of Mathematics Syracuse University Syracuse NY,
GENERIC AND ABSTRACT RIGIDITY Brigitte Servatius and Herman Servatius Department of Mathematics Syracuse University Syracuse NY, 13244-1150 Rigidity We are all familiar with frameworks of rods attached
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 informationThe Minimal Rank Problem for Finite Fields. Wayne Barrett (BYU) Hein van der Holst (Eindhoven) Raphael Loewy (Technion) Don March (BYU)
The Minimal Rank Problem for Finite Fields Wayne Barrett (BYU) Hein van der Holst (Eindhoven) Raphael Loewy (Technion) Don March (BYU) 12th ILAS Meeting - Regina June 26-29, 2005 References [BvdHL1] Barrett,
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph Hisayuki HARA and Akimichi TAKEMURA METR 2006 41 July 2006 DEPARTMENT
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 10/31/16
60.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 0/3/6 6. Introduction We talked a lot the last lecture about greedy algorithms. While both Prim
More informationAn Introduction to Transversal Matroids
An Introduction to Transversal Matroids Joseph E Bonin The George Washington University These slides and an accompanying expository paper (in essence, notes for this talk, and more) are available at http://homegwuedu/
More informationSemidefinite Programming
Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has
More informationPartitioned Covariance Matrices and Partial Correlations. Proposition 1 Let the (p + q) (p + q) covariance matrix C > 0 be partitioned as C = C11 C 12
Partitioned Covariance Matrices and Partial Correlations Proposition 1 Let the (p + q (p + q covariance matrix C > 0 be partitioned as ( C11 C C = 12 C 21 C 22 Then the symmetric matrix C > 0 has the following
More informationRigidity of Skeletal Structures
CHAPTER 3 Rigidity of Skeletal Structures 3. INTRODUCTION The rigidity of structures has been studied by pioneering structural engineers such as Henneberg [79] and Müller-Breslau [76]. The methods they
More informationLecture 3: Tropicalizations of Cluster Algebras Examples David Speyer
Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer Let A be a cluster algebra with B-matrix B. Let X be Spec A with all of the cluster variables inverted, and embed X into a torus by
More informationHomotopy types of moment-angle complexes
Homotopy types of moment-angle complexes based on joint work with Jelena Grbic, Stephen Theriault and Jie Wu Taras Panov Lomonosov Moscow State University The 39th Symposium on Transformation Groups Tokyo
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 informationLecture Notes 1: Vector spaces
Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector
More informationChapter 6 Orthogonal representations II: Minimal dimension
Chapter 6 Orthogonal representations II: Minimal dimension Nachdiplomvorlesung by László Lovász ETH Zürich, Spring 2014 1 Minimum dimension Perhaps the most natural way to be economic in constructing an
More informationPERFECT BINARY MATROIDS
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT PERFECT BINARY MATROIDS Allan Mills August 1999 No. 1999-8 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookeville, TN 38505 PERFECT BINARY MATROIDS ALLAN D. MILLS Abstract.
More informationTree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationThe definition of a vector space (V, +, )
The definition of a vector space (V, +, ) 1. For any u and v in V, u + v is also in V. 2. For any u and v in V, u + v = v + u. 3. For any u, v, w in V, u + ( v + w) = ( u + v) + w. 4. There is an element
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationarxiv: v1 [math.co] 19 Aug 2016
THE EXCHANGE GRAPHS OF WEAKLY SEPARATED COLLECTIONS MEENA JAGADEESAN arxiv:1608.05723v1 [math.co] 19 Aug 2016 Abstract. Weakly separated collections arise in the cluster algebra derived from the Plücker
More informationCombinatorial Reciprocity Theorems
Combinatorial Reciprocity Theorems Matthias Beck San Francisco State University math.sfsu.edu/beck based on joint work with Raman Sanyal Universität Frankfurt JCCA 2018 Sendai Thomas Zaslavsky Binghamton
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationRandom Lifts of Graphs
27th Brazilian Math Colloquium, July 09 Plan of this talk A brief introduction to the probabilistic method. A quick review of expander graphs and their spectrum. Lifts, random lifts and their properties.
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 22. Smith normal form of an integer matrix (linear algebra over Z).
18.312: Algebraic Combinatorics Lionel Levine Lecture date: May 3, 2011 Lecture 22 Notes by: Lou Odette This lecture: Smith normal form of an integer matrix (linear algebra over Z). 1 Review of Abelian
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 informationChordal structure in computer algebra: Permanents
Chordal structure in computer algebra: Permanents Diego Cifuentes Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology Joint
More informationGeometric Constraints II
Geometric Constraints II Realizability, Rigidity and Related theorems. Embeddability of Metric Spaces Section 1 Given the matrix D d i,j 1 i,j n corresponding to a metric space, give conditions under which
More informationThe Topology of Intersections of Coloring Complexes
The Topology of Intersections of Coloring Complexes Jakob Jonsson October 19, 2005 Abstract In a construction due to Steingrímsson, a simplicial complex is associated to each simple graph; the complex
More informationDynamic Programming on Trees. Example: Independent Set on T = (V, E) rooted at r V.
Dynamic Programming on Trees Example: Independent Set on T = (V, E) rooted at r V. For v V let T v denote the subtree rooted at v. Let f + (v) be the size of a maximum independent set for T v that contains
More informationComplexity of the positive semidefinite matrix completion problem with a rank constraint
Complexity of the positive semidefinite matrix completion problem with a rank constraint M. E.-Nagy 1, M. Laurent 1,2, and A. Varvitsiotis 1 1 Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands.
More informationNOTES ON HYPERBOLICITY CONES
NOTES ON HYPERBOLICITY CONES Petter Brändén (Stockholm) pbranden@math.su.se Berkeley, October 2010 1. Hyperbolic programming A hyperbolic program is an optimization problem of the form minimize c T x such
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 informationThe regularity method and blow-up lemmas for sparse graphs
The regularity method and blow-up lemmas for sparse graphs Y. Kohayakawa (São Paulo) SPSAS Algorithms, Combinatorics and Optimization University of São Paulo July 2016 Partially supported CAPES/DAAD (430/15),
More informationIsotropic matroids III: Connectivity
Isotropic matroids III: Connectivity Robert Brijder Hasselt University Belgium robert.brijder@uhasselt.be Lorenzo Traldi Lafayette College Easton, Pennsylvania 18042, USA traldil@lafayette.edu arxiv:1602.03899v2
More informationThe minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
More informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
More informationMATROIDS DENSER THAN A PROJECTIVE GEOMETRY
MATROIDS DENSER THAN A PROJECTIVE GEOMETRY PETER NELSON Abstract. The growth-rate function for a minor-closed class M of matroids is the function h where, for each non-negative integer r, h(r) is the maximum
More informationORIE 6334 Spectral Graph Theory September 8, Lecture 6. In order to do the first proof, we need to use the following fact.
ORIE 6334 Spectral Graph Theory September 8, 2016 Lecture 6 Lecturer: David P. Williamson Scribe: Faisal Alkaabneh 1 The Matrix-Tree Theorem In this lecture, we continue to see the usefulness of the graph
More informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
More informationInvolutions of the Symmetric Group and Congruence B-Orbits (Extended Abstract)
FPSAC 010, San Francisco, USA DMTCS proc. AN, 010, 353 364 Involutions of the Symmetric Group and Congruence B-Orbits (Extended Abstract) Eli Bagno 1 and Yonah Cherniavsky 1 Jerusalem College of Technology,
More informationSimplicial and Cellular Spanning Trees, II: Applications
Simplicial and Cellular Spanning Trees, II: Applications Art Duval (University of Texas at El Paso) Caroline Klivans (Brown University) Jeremy Martin (University of Kansas) University of California, Davis
More informationOn minors of the compound matrix of a Laplacian
On minors of the compound matrix of a Laplacian R. B. Bapat 1 Indian Statistical Institute New Delhi, 110016, India e-mail: rbb@isid.ac.in August 28, 2013 Abstract: Let L be an n n matrix with zero row
More informationA multivariate interlace polynomial
A multivariate interlace polynomial Bruno Courcelle LaBRI, Université Bordeaux 1 and CNRS General objectives : Logical descriptions of graph polynomials Application to their computations Systematic construction
More informationClassical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems Rani M. R, Mohith Jagalmohanan, R. Subashini Binary matrices having simultaneous consecutive
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
More informationThe minimum rank of matrices and the equivalence class graph
Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,
More informationarxiv: v1 [math.co] 20 Sep 2012
arxiv:1209.4628v1 [math.co] 20 Sep 2012 A graph minors characterization of signed graphs whose signed Colin de Verdière parameter ν is two Marina Arav, Frank J. Hall, Zhongshan Li, Hein van der Holst Department
More informationSPECTRAHEDRA. Bernd Sturmfels UC Berkeley
SPECTRAHEDRA Bernd Sturmfels UC Berkeley Mathematics Colloquium, North Carolina State University February 5, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent:
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationMaps of matroids with applications
Discrete Mathematics 303 (2005) 75 85 www.elsevier.com/locate/disc Maps of matroids with applications András Recski a,b, a Department of Computer Science and Information Theory, Budapest University of
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 informationGraph Classes and Ramsey Numbers
Graph Classes and Ramsey Numbers Rémy Belmonte, Pinar Heggernes, Pim van t Hof, Arash Rafiey, and Reza Saei Department of Informatics, University of Bergen, Norway Abstract. For a graph class G and any
More informationUNIVERSALLY OPTIMAL MATRICES AND FIELD INDEPENDENCE OF THE MINIMUM RANK OF A GRAPH. June 20, 2008
UNIVERSALLY OPTIMAL MATRICES AND FIELD INDEPENDENCE OF THE MINIMUM RANK OF A GRAPH LUZ M. DEALBA, JASON GROUT, LESLIE HOGBEN, RANA MIKKELSON, AND KAELA RASMUSSEN June 20, 2008 Abstract. The minimum rank
More information