Recognition: unknown
A central limit theorem in the β-model for undirected random graphs with a diverging number of vertices
classification
🧮 math.ST
stat.TH
keywords
betamodelnumberverticesapproximatingasymptoticcentralchatterjee
read the original abstract
Chatterjee, Diaconis and Sly (2011) recently established the consistency of the maximum likelihood estimate in the $\beta$-model when the number of vertices goes to infinity. By approximating the inverse of the Fisher information matrix, we obtain its asymptotic normality under mild conditions. Simulation studies and a data example illustrate the theoretical results.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.