Extreme clustering coefficients in high edge density networks

This paper proposed two models with extreme average clustering coefficients and small path length properties for high edge density network. High density networks are common in the analysis of social networks and biological networks. In addition to those properties, the proposed models indicated that in addition to the existing small-world network model and random network model, there are other network models that may produce clustering coefficients filling the gap between those two models and the maximal achievable clustering coefficients.