Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs

DOI10.1007/s10463-016-0560-2zbMath1400.62124arXiv1401.4896OpenAlexW2962856988MaRDI QIDQ2397339

Sonja Petrović, Elizabeth Gross, Despina Stasi

Publication date: 22 May 2017

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

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

zbMATH Keywords

hypergraphsocial networksrandom graphnetwork modelcontingency tabletoric idealalgebraic statisticsMarkov basissampling algorithm

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80) Contingency tables (62H17) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items (5)

Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas ⋮ Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs ⋮ What Are Higher-Order Networks? ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling

Uses Software

• R
• Pajek datasets
• 4ti2
• igraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov degree of the Birkhoff model
• Markov bases in algebraic statistics.
• The three-state toric homogeneous Markov chain model has Markov degree two
• Minimal and minimal invariant Markov bases of decomposable models for contingency tables
• Random graphs with a given degree sequence
• Lectures on algebraic statistics
• A Markov basis for conditional test of common diagonal effect in quasi-independence model for square contingency tables
• Markov bases of binary graph models of \(K_{4}\)-minor free graphs
• Markov bases for two-way subtable sum problems
• Markov bases of binary graph models
• Markov bases for decomposable graphical models
• A divide-and-conquer algorithm for generating Markov bases of multi-way tables
• Algebraic algorithms for sampling from conditional distributions
• Commutative algebra of statistical ranking
• Graver basis for an undirected graph and its application to testing the beta model of random graphs
• Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
• Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
• Toric algebra of hypergraphs
• Markov degree of the three-state toric homogeneous Markov chain model
• Sequential importance sampling for multiway tables
• Markov bases and subbases for bounded contingency tables
• COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS
• Sampling large tables with constraints
• Connecting tables with zero-one entries by a subset of a Markov basis
• Algebraic statistics for a directed random graph model with reciprocation
• Goodness of Fit of Social Network Models
• An Exponential Family of Probability Distributions for Directed Graphs
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• Monomial Algebras
• A Survey of Statistical Network Models
• Markov chain Monte Carlo exact tests for incomplete two-way contingency tables

This page was built for publication: Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs