A random graph of moderate density

We analyse a randomly growing graph model in which the average degree is asymptotically equal to constant times square root of number vertices, and clustering coefficient rather small. In every step, we choose two vertices uniformly at random, check whether they are connected or not, either add new edge delete one vertex graph. This dependence on status connection chosen makes total random after n steps. prove asymptotic normality for this quantity also fixed (with normalization n1∕6). proportion with greater than multiple degree, maximal degree.