A central limit theorem in the $β$-model for undirected random graphs with a diverging number of vertices

Details A central limit theorem in the $β$-model for undirected random graphs with a diverging number of vertices A central limit theorem in the $β$-model for undirected random graphs with a diverging number of vertices

2012-02-15

arxiv.org/abs/1202.3307v1

Mathematics

Statistics Theory

7pages. 2 tables

Scientific paper

The $\beta$-model provides a convenient tool for analyzing network data and Chatterjee, Diaconis and Sly (2011) recently established the consistency of the maximum likelihood estimate (MLE) in the $\beta$-model when the number of vertices goes to infinity. In this note, by effectively approximating the inverse of the Fisher information matrix, we further obtain its asymptotic normality under mild conditions. Simulation studies and a data example are also provided to illustrate the theoretical results.

Affiliated with

Also associated with

No associations

Rating

A central limit theorem in the $β$-model for undirected random graphs with a diverging number of vertices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A central limit theorem in the $β$-model for undirected random graphs with a diverging number of vertices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A central limit theorem in the $β$-model for undirected random graphs with a diverging number of vertices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-557833