Algebraic statistics for a directed random graph model with reciprocation

zbMath1197.13025arXiv0909.0073MaRDI QIDQ3581611

Sonja Petrović, Alessandro Rinaldo, Stephen E. Fienberg

Publication date: 2 September 2010

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

zbMATH Keywords

Gröbner basistoric idealrandom networkMarkov basis\(p_1\) modeledge subring of a graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (10)

Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas ⋮ 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 ⋮ Commutative algebra of statistical ranking ⋮ Graver basis for an undirected graph and its application to testing the beta model of random graphs ⋮ Neural ideals and stimulus space visualization ⋮ Toric algebra of hypergraphs ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Asymptotics in directed exponential random graph models with an increasing bi-degree sequence

Uses Software

• polymake

This page was built for publication: Algebraic statistics for a directed random graph model with reciprocation