Toric algebra of hypergraphs
From MaRDI portal
Abstract: The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs. Our results generalize those for the defining ideals of edge subrings of graphs, which are well-known in the commutative algebra community, and popular in the algebraic statistics community. One of the motivations for studying toric ideals of hypergraphs comes from algebraic statistics, where generators of the toric ideal give a basis for random walks on fibers of the statistical model specified by the hypergraph. Further, understanding the structure of the generators gives insight into the model geometry.
Recommendations
- Algebraic properties of toric rings of graphs
- Hypergraph encodings of arbitrary toric ideals
- Toric arrangements associated to graphs
- Hypergraphs as algebraic structures
- G-Graphs and Algebraic Hypergraphs
- scientific article; zbMATH DE number 195200
- Toral arrangements and hyperplane arrangements
- Vertex Algebras Associated with Hypertoric Varieties
- Torus graphs and simplicial posets
- Combinatorial degree bound for toric ideals of hypergraphs
Cites work
- Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems
- Algebraic statistics for a directed random graph model with reciprocation
- Combinatorial degree bound for toric ideals of hypergraphs
- Commutative algebra of statistical ranking
- Compressed polytopes, initial ideals and complete multipartite graphs
- Geometric discrepancy. An illustrated guide
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- scientific article; zbMATH DE number 1324671 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- Lectures on algebraic statistics
- Maximum likelihood estimation in the -model
- Minimal generators of toric ideals of graphs
- Monomial and toric ideals associated to Ferrers graphs
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- Multigraded commutative algebra of graph decompositions
- On the ideal theory of graphs
- Rees algebras of edge ideals
- Relations among conditional probabilities
- Tight hardness results for minimizing discrepancy
- Toric ideals generalized by quadratic binomials
Cited in
(20)- Bouquet algebra of toric ideals
- Neural ideals and stimulus space visualization
- Koszul blowup algebras associated to three-dimensional Ferrers diagrams
- Hypergraph encodings of arbitrary toric ideals
- On toric ideals arising from signed graphs
- On regularity bounds and linear resolutions of toric algebras of graphs
- Hypergraphs induced by algebras of fixed type
- Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
- Weakly saturated hypergraphs and exterior algebra
- Combinatorial degree bound for toric ideals of hypergraphs
- A survey of discrete methods in (algebraic) statistics for networks
- On hyper-torre isols
- Toric ideals of weighted oriented graphs
- CIO and ring graphs: deficiency and testing
- The geometry of rank-one tensor completion
- Toric varieties associated with weighted graphs
- Self-dual projective toric varieties and their ideals
- Lawrence lifts, matroids, and maximum likelihood degrees
- Generalized multiplicities of edge ideals
- Irreducible Markov chains on spaces of graphs with fixed degree-color sequences
This page was built for publication: Toric algebra of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441562)
