Approximate estimation in a class of directed networks

DOI10.1080/03610926.2019.1565841OpenAlexW2913096485MaRDI QIDQ5079113

Jing Luo, Laala Zeyneb, Zhenghong Wang, Qian-Qian Chen

Publication date: 25 May 2022

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610926.2019.1565841

zbMATH Keywords

generalized linear modelsparse random graphnull modelapproximate likelihood-based estimationdirected network data

Mathematics Subject Classification ID

Asymptotic properties of parametric estimators (62F12) Asymptotic distribution theory in statistics (62E20) Statistics (62-XX)

Cites Work

• Unnamed Item
• Maximum likelihood estimation in the \(\beta\)-model
• Random graphs with a given degree sequence
• Connected components in random graphs with given expected degree sequences
• Degree-based moment estimation for ordered networks
• A nonparametric view of network models and Newman–Girvan and other modularities
• Asymptotics in undirected random graph models parameterized by the strengths of vertices
• An Exponential Family of Probability Distributions for Directed Graphs
• A note on asymptotic distributions in directed exponential random graph models with bi-degree sequences
• Probability Inequalities for Sums of Bounded Random Variables
• Asymptotics in directed exponential random graph models with an increasing bi-degree sequence

This page was built for publication: Approximate estimation in a class of directed networks