Vol. 5, No. 1, 2013

Download this article
Download this article For screen
Recent Issues
Volume 7, Issue 1
Volume 6, Issue 1
Volume 5, Issue 1
Volume 4, Issue 1
Volume 3, Issue 1
Volume 2, Issue 1
Volume 1, Issue 1
The Journal
Cover
Editorial Board
Editors’ Addresses
About the Journal
Submission Guidelines
Submission Form
Editorial Login
Contacts
Graphical models

Luis David García-Puente, Sonja Petrović and Seth Sullivant

Vol. 5 (2013), 1–7
Abstract

The Macaulay2 package GraphicalModels contains algorithms for the algebraic study of graphical models associated to undirected, directed and mixed graphs, and associated collections of conditional independence statements. Among the algorithms implemented are procedures for computing the vanishing ideal of graphical models, for generating conditional independence ideals of families of independence statements associated to graphs, and for checking for identifiable parameters in Gaussian mixed graph models. These procedures can be used to study fundamental problems about graphical models.

Mathematical Subject Classification 2010
Primary: 13P25
Secondary: 14Q99, 62H99, 68W30
Supplementary material

GraphicalModels source code

Milestones
Received: 31 August 2012
Revised: 1 January 2013
Accepted: 5 March 2013
Authors
Luis David García-Puente
Department of Mathematics and Statistics
Sam Houston State University
Huntsville, TX 77341
United States
Sonja Petrović
Department of Applied Mathematics
Illinois Institute of Technology
Engineering 1
room 111A 10 West 32nd Street
Chicago, IL 60616
United States
Seth Sullivant
Department of Mathematics
North Carolina State University
Box 8205
Raleigh, NC 27695
United States