Hierarchical models for independence structures of networks
From MaRDI portal
Publication:6067699
DOI10.1111/stan.12200arXiv1605.04565OpenAlexW2992330881WikidataQ126629598 ScholiaQ126629598MaRDI QIDQ6067699
Kayvan Sadeghi, Alessandro Rinaldo
Publication date: 14 December 2023
Published in: Statistica Neerlandica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.04565
dependency graphgraphical modelslog-linear modelssocial network analysisexponential random graph models
Cites Work
- Unnamed Item
- Unnamed Item
- Maximum likelihood estimation in the \(\beta\)-model
- Random graphs with a given degree sequence
- Gaussian Markov distributions over finite graphs
- Markov fields and log-linear interaction models for contingency tables
- Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
- On the geometry of discrete exponential families with application to exponential random graph models
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Instability, Sensitivity, and Degeneracy of Discrete Exponential Families
- Binary Models for Marginal Independence
- Parameterizations and Fitting of Bi‐directed Graph Models to Categorical Data
- Goodness of Fit of Social Network Models
- Markov Graphs
- LAPACK Users' Guide
- An Exponential Family of Probability Distributions for Directed Graphs
- Random Networks, Graphical Models and Exchangeability
- On Exchangeability in Network Models
- Log-mean linear models for binary data
- Discrete Multivariate Analysis Theory and Practice
This page was built for publication: Hierarchical models for independence structures of networks