On the Internet-graph clustering coefficient

We consider a configuration graph with N vertices whose degrees are independent and identically distributed according to the power law depending on slowly varying function. Configuration graphs widely used for modeling complex communication networks such as Internet. The parameter of power-law distribution is usually selected so that vertex degree has finite expectation infinite variance. An important characteristic topology global clustering coefficient. Clustering measures extent which neighbours also each other’s neighbours. prove limit theorem coefficient tends infinity.