Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
From MaRDI portal
Publication:2397339
Abstract: Social networks and other large sparse data sets pose significant challenges for statistical inference, as many standard statistical methods for testing model fit are not applicable in such settings. Algebraic statistics offers a theoretically justified approach to goodness-of-fit testing that relies on the theory of Markov bases and is intimately connected with the geometry of the model as described by its fibers. Most current practices require the computation of the entire basis, which is infeasible in many practical settings. We present a dynamic approach to explore the fiber of a model, which bypasses this issue, and is based on the combinatorics of hypergraphs arising from the toric algebra structure of log-linear models. We demonstrate the approach on the Holland-Leinhardt model for random directed graphs that allows for reciprocated edges.
Recommendations
Cites work
- scientific article; zbMATH DE number 3519741 (Why is no real title available?)
- scientific article; zbMATH DE number 1350773 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- A Markov basis for conditional test of common diagonal effect in quasi-independence model for square contingency tables
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- A survey of statistical network models
- Algebraic algorithms for sampling from conditional distributions
- Algebraic statistics and contingency table problems: log-linear models, likelihood estimatio, and disclosure limitation
- Algebraic statistics for a directed random graph model with reciprocation
- An Exponential Family of Probability Distributions for Directed Graphs
- Combinatorial degree bound for toric ideals of hypergraphs
- Commutative algebra of statistical ranking
- Connecting tables with zero-one entries by a subset of a Markov basis
- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
- Goodness of Fit of Social Network Models
- Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- Lectures on algebraic statistics
- Markov bases and subbases for bounded contingency tables
- Markov bases for decomposable graphical models
- Markov bases for two-way subtable sum problems
- Markov bases of binary graph models
- Markov bases of binary graph models of \(K_{4}\)-minor free graphs
- Markov chain Monte Carlo exact tests for incomplete two-way contingency tables
- Markov degree of the Birkhoff model
- Markov degree of the three-state toric homogeneous Markov chain model
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
- Minimal and minimal invariant Markov bases of decomposable models for contingency tables
- Monomial algebras
- Random graphs with a given degree sequence
- Sampling large tables with constraints
- Sequential importance sampling for multiway tables
- The three-state toric homogeneous Markov chain model has Markov degree two
- Toric algebra of hypergraphs
Cited in
(7)- Markov Bases: A 25 Year Update
- Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas
- A survey of discrete methods in (algebraic) statistics for networks
- New classes of degree sequences with fast mixing swap Markov chain sampling
- Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
- What Are Higher-Order Networks?
- Gibbs regression and a test for goodness-of-fit
This page was built for publication: Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397339)
