Skip to main content
SpringerLink
Log in

Normal binary graph models

  • Published:
Annals of the Institute of Statistical Mathematics Aims and scope Submit manuscript

Abstract

We show that the marginal semigroup of a binary graph model is normal if and only if the graph is free of K 4 minors. The technique, based on the interplay of normality and the geometry of the marginal cone, has potential applications to other normality questions in algebraic statistics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Barahona F., Mahjoub A.R. (1986) On the cut polytope. Mathematical Programming 36: 157–173

    Article  MATH  MathSciNet  Google Scholar 

  • Bruns, W., Ichim, B. (2007). Normaliz 2. Algorithms for affine semigroups and rational cones. Available from http://www.math.uos.de/normaliz.

  • Bruns, W., Hemmecke, R., Ichim, B., Köppe, M., Söger, C. (2009). Challenging computations of Hilbert bases of cones associated with algebraic statistics. Manuscript.

  • Develin M., Sullivant S. (2003) Markov bases of binary graph models. Annals of Combinatorics 7: 441–466

    Article  MATH  MathSciNet  Google Scholar 

  • Deza, M. M., Laurent, M. (1997). Geometry of cuts and metrics. Algorithms and combinatorics (Vol. 15). Berlin: Springer.

  • Diaconis P., Sturmfels B. (1998) Algebraic algorithms for sampling from conditional distributions. Annals of Statistics 26: 363–397

    Article  MATH  MathSciNet  Google Scholar 

  • Geiger D., Meek C., Sturmfels B. (2006) On the toric algebra of graphical models. Annals of Statistics 34: 1463–1492

    Article  MATH  MathSciNet  Google Scholar 

  • Hoşten S., Sullivant S. (2002) Gröbner bases and polyhedral geometry of reducible and cyclic models. Journal of Combinatorial Theory: Series A 100(2): 277–301

    Article  MATH  MathSciNet  Google Scholar 

  • Sturmfels B., Sullivant S. (2008) Toric geometry of cuts and splits. Michigan Mathematical Journal 57: 689–709

    Article  MATH  MathSciNet  Google Scholar 

  • Takemura A., Yoshida R. (2008) A generalization of the integer linear infeasibility problem. Discrete Optimization 5: 36–52

    Article  MATH  MathSciNet  Google Scholar 

  • Willenborg, L., de Waal, T. (2001). Elements of statistical disclosure control. Lecture notes in statistics (Vol. 155). New York: Springer.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, North Carolina State University, Box 8205, Raleigh, NC, 27695, USA

    Seth Sullivant

Authors
  1. Seth Sullivant
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seth Sullivant.

Additional information

S. Sullivant was supported by U.S. National Science Foundation grant DMS-0840795.

About this article

Cite this article

Sullivant, S. Normal binary graph models. Ann Inst Stat Math 62, 717–726 (2010). https://doi.org/10.1007/s10463-010-0296-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10463-010-0296-3

Keywords

Search

Navigation