Generalized Permutohedra from Probabilistic Graphical Models

DOI10.1137/16M107894XOpenAlexW2963303827MaRDI QIDQ4601214FDOQ4601214

Authors:

Publication date: 12 January 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.01814

zbMATH Keywords

entropycausal inferencegraphical modelmatroidsubmodular functionpermutohedrongraphoid

Mathematics Subject Classification ID

Characterization and structure theory for multivariate probability distributions; copulas (62H05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

Cites Work

• A characterization of Markov equivalence classes for acyclic digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• 10.1162/153244302760200696
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lectures on algebraic statistics
• Discrete Convex Analysis
• Lectures on Polytopes
• Triangulations. Structures for algorithms and applications
• Geometry of the faithfulness assumption in causal inference
• Title not available (Why is that?)
• Submodular functions and optimization.
• Coxeter complexes and graph-associahedra
• 10.1162/153244303321897717
• Faces of generalized permutohedra
• A realization of graph associahedra
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• Markov properties for mixed graphs
• On Gaussian conditional independence structures
• Three Counter-Examples on Semi-Graphoids
• Convex rank tests and semigraphoids
• Smoothness of Gaussian conditional independence models
• A geometric view on learning Bayesian network structures
• Gaussian conditional independence relations have no finite complete characterization
• Title not available (Why is that?)
• Characteristic imsets for learning Bayesian network structure
• Polyhedral approach to statistical learning graphical models

Cited In (6)

• Greedy Causal Discovery Is Geometric
• The geometry of gaussoids
• When are multidegrees positive?
• When are multidegrees positive?
• Generalized permutahedra: Minkowski linear functionals and Ehrhart positivity
• Generalized permutation polytopes and exploratory graphical methods for ranked data

This page was built for publication: Generalized Permutohedra from Probabilistic Graphical Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601214)