On the toric algebra of graphical models
From MaRDI portal
Publication:2500459
Abstract: We formulate necessary and sufficient conditions for an arbitrary discrete probability distribution to factor according to an undirected graphical model, or a log-linear model, or other more general exponential models. For decomposable graphical models these conditions are equivalent to a set of conditional independence statements similar to the Hammersley--Clifford theorem; however, we show that for nondecomposable graphical models they are not. We also show that nondecomposable models can have nonrational maximum likelihood estimates. These results are used to give several novel characterizations of decomposable graphical models.
Recommendations
- A new algorithm for the maximum likelihood estimation of graphical log-linear models
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- scientific article; zbMATH DE number 4211299
- Gaussian graphical models with toric vanishing ideals
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
Cites work
- scientific article; zbMATH DE number 4060777 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 44577 (Why is no real title available?)
- scientific article; zbMATH DE number 48904 (Why is no real title available?)
- scientific article; zbMATH DE number 3471416 (Why is no real title available?)
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- scientific article; zbMATH DE number 3602484 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1560708 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 3424129 (Why is no real title available?)
- Additive and multiplicative models and interactions
- Algebraic algorithms for sampling from conditional distributions
- Algebraic geometry of Bayesian networks
- Conditional Independences among Four Random Variables I
- Geometry, moments and conditional independence trees with hidden variables.
- Gröbner bases and polyhedral geometry of reducible and cyclic models.
- Interactions in Multidimensional Contingency Tables
- Logical and algorithmic properties of conditional independence and graphical models
- Markov Point Processes
- Markov bases for decomposable graphical models
- Markov fields and log-linear interaction models for contingency tables
- Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency Tables
- Stratified exponential families: Graphical models and model selection
Cited in
(80)- Total positivity in exponential families with application to binary variables
- Polynomial relations among principal minors of a 4 4-matrix
- Maximum likelihood estimation in the -model
- Specializations of multigradings and the arithmetical rank of lattice ideals
- Decomposable context-specific models
- Positive margins and primary decomposition
- Tree cumulants and the geometry of binary tree models
- Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
- Markov Bases: A 25 Year Update
- Equivalence classes of staged trees
- Markov bases of binary graph models of \(K_{4}\)-minor free graphs
- On the geometry of discrete exponential families with application to exponential random graph models
- Classical iterative proportional scaling of log-linear models with rational maximum likelihood estimator
- Quasi-independence models with rational maximum likelihood estimator
- On factorization of probability distributions over directed graphs.
- The maximum likelihood degree of toric varieties
- Maximizing the Bregman divergence from a Bregman family
- Algebraic structures in statistical methodology. Abstracts from the workshop held December 4--10, 2022
- Algebraic geometry of Bayesian networks
- A note on Gibbs and Markov random fields with constraints and their moments
- Symmetrically Colored Gaussian Graphical Models with Toric Vanishing Ideals
- Variations on undirected graphical models and their relationships
- Markov bases of conditional independence models for permutations
- Mixture decompositions of exponential families using a decomposition of their sample spaces
- Higher Lawrence configurations.
- Natural gradient flow in the mixture geometry of a discrete exponential family
- Characterization of convolution splitting graphical models
- Commutative algebra of statistical ranking
- One-dimensional Markov random fields, Markov chains and topological Markov fields
- Maximizing the divergence from a hierarchical model of quantum states
- Normal binary graph models
- Support sets in exponential families and oriented matroid theory
- The face lattice of the set of reduced density matrices and its coatoms
- MCMC using Markov bases for computing \(p\)-values in decomposable log-linear models
- Compression schemes for concept classes induced by three types of discrete undirected graphical models
- Staged tree models with toric structure
- Minimal and minimal invariant Markov bases of decomposable models for contingency tables
- Indispensable binomials in semigroup ideals
- Symmetric measures via moments
- Equations defining probability tree models
- The space of compatible full conditionals is a unimodular toric variety
- Graphical models for correlated defaults
- Three Counter-Examples on Semi-Graphoids
- On the role of the overall effect in exponential families
- Gaussian graphical models with toric vanishing ideals
- Nonlinear algebra and applications
- A Markov basis for conditional test of common diagonal effect in quasi-independence model for square contingency tables
- Algebra in combinatorics of statistical dependence
- Markov bases for two-way subtable sum problems
- A class of statistical models to weaken independence in two-way contingency tables
- Minimal primes of ideals arising from conditional independence statements
- Epistemic conditions for rationalizability
- Discovery of statistical equivalence classes using computer algebra
- Computing images of polynomial maps
- The algebra of reversible Markov chains
- On the closure of relational models
- Gröbner bases and polyhedral geometry of reducible and cyclic models.
- When does a mixture of products contain a product of mixtures?
- Graphical models
- Optimally approximating exponential families
- A Gröbner basis characterization for chordal comparability graphs
- Bayes factors and the geometry of discrete hierarchical loglinear models
- Maximum likelihood estimation in log-linear models
- Generalisation of the Hammersley-Clifford theorem on bipartite graphs
- Markov random fields, Markov cocycles and the 3-colored chessboard
- A note on faithfulness and total positivity
- Dimension of Marginals of Kronecker Product Models
- Toric invariant theory for maximum likelihood estimation in log-linear models
- A new characterization of discrete decomposable graphical models
- Conditions for swappability of records in a microdata set when some marginals are fixed
- Toric statistical models: parametric and binomial representations
- Moment maps, strict linear precision, and maximum likelihood degree one
- Game theory of undirected graphical models
- Testing the fit of relational models
- A variational principle for ground spaces
- Conjunctive Bayesian networks
- Toric and Non-toric Bayesian Networks
- Cumulant varieties
- Ideals of graph homomorphisms
- A short history of algebraic statistics
This page was built for publication: On the toric algebra of graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500459)
