A Law of Large Numbers and Central Limit Theorem for the Leaves in a Random Graph Model

Abstract

We are calculating the expectation and variance of the number of leaves in the scale-free network model suggested in [CL06]. Afterwards, we prove a Law of Large Numbers and a Central Limit Theorem for the number of leaves using the Martingale Central Limit Theorem. Finally, we check our results by simulation.