Achieving high clustering in scale-free networks
Average shortest path (sometimes network diameter), degree distribution and clustering are the three main network characteristics. Path lengths tend to be small in random network models (average shortest path and network diameter grows as \( \ln N \) or slower). Power-law degree distribution can be obtained from the Barabasi-Albert and some other models. But clustering appears to be trickier to reproduce together with the previous two. In this text we will discuss what clustering actually is and how to obtain it in random network model.