Algebraic statistics for a directed random graph model with reciprocation

MaRDI QIDQ3581611zbMATH OpenFDO

Authors 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

\(p_1\) modeledge subring of a graphGröbner basisMarkov basisrandom networktoric ideal

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) Toric varieties, Newton polyhedra, Okounkov bodies (14M25)

Abstract: The p_1 model is a directed random graph model used to describe dyadic interactions in a social network in terms of effects due to differential attraction (popularity) and expansiveness, as well as an additional effect due to reciprocation. In this article we carry out an algebraic statistics analysis of this model. We show that the p_1 model is a toric model specified by a multi-homogeneous ideal. We conduct an extensive study of the Markov bases for p_1 models that incorporate explicitly the constraint arising from multi-homogeneity. Our results are directly relevant to the estimation and conditional goodness-of-fit testing problems in p_1 models.

Recommendations

• The statistics of random directed graphs
• Reciprocal properties of random fields on undirected graphs
• Directed random graphs with given degree distributions
• Random networks, graphical models and exchangeability
• Random graphs: models and asymptotic characteristics
• On exchangeable random variables and the statistics of large graphs and hypergraphs
• Stochastic processes in random graphs
• Dirac's theorem for random graphs
• scientific article; zbMATH DE number 4196022
• A simulation study of the p₁ model for directed random graphs

Cited in

(15)

• Detection thresholds for the \(\beta\)-model on sparse graphs
• Neural ideals and stimulus space visualization
• Commutative algebra of statistical ranking
• Graver basis for an undirected graph and its application to testing the beta model of random graphs
• Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas
• Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
• Toric algebra of hypergraphs
• A survey of discrete methods in (algebraic) statistics for networks
• Maximum likelihood estimation in the -model
• p₂: a random effects model with covariates for directed graphs
• Regression of directed graphs on independent effects for density and reciprocity
• Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
• Conditional inference given partial information in contingency tables using Markov bases
• Markov Bases: A 25 Year Update
• Modelling directed networks with reciprocity

Describes a project that uses

Uses Software

• polymake

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581611)