Graver basis for an undirected graph and its application to testing the beta model of random graphs

DOI10.1007/s10463-012-0367-8zbMath1440.13114arXiv1102.2583OpenAlexW2102028572MaRDI QIDQ1934480

Hisayuki Hara, Mitsunori Ogawa, Akimichi Takemura

Publication date: 28 January 2013

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Markov chain Monte Carlotoric idealRasch modelMarkov basis

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Contingency tables (62H17)

Related Items (10)

Detection thresholds for the \(\beta\)-model on sparse graphs ⋮ Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs ⋮ Maximum likelihood estimation in the \(\beta\)-model ⋮ Toric algebra of hypergraphs ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Testing goodness of fit of random graph models ⋮ Exact Goodness‐of‐Fit Testing for the Ising Model ⋮ Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs ⋮ Edge rings with \(q\)-linear resolutions ⋮ Toric ideals associated with gap-free graphs

Uses Software

• 4ti2

Cites Work

• Unnamed Item
• Random graphs with a given degree sequence
• Minimal generators of toric ideals of graphs
• Lectures on algebraic statistics
• Nonlinear discrete optimization. An algorithmic theory
• Koszul bipartite graphs
• Toric ideals generalized by quadratic binomials
• Algebraic algorithms for sampling from conditional distributions
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Connecting tables with zero-one entries by a subset of a Markov basis
• Algebraic statistics for a directed random graph model with reciprocation
• An Exponential Family of Probability Distributions for Directed Graphs
• The Structure and Function of Complex Networks
• A Survey of Statistical Network Models
• Collective dynamics of ‘small-world’ networks
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS

This page was built for publication: Graver basis for an undirected graph and its application to testing the beta model of random graphs