Highly clustered complex networks in the configuration model: Random regular small-world network

Abstract

We propose a method to make a highly clustered complex network within the configuration model. Using this method, we generated highly clustered random regular networks and analyzed their properties. We show that highly clustered random regular networks with appropriate parameters satisfy all the conditions of the small-world network: connectedness, high clustering coefficient, and small-world effect. We also study how clustering affects the percolation threshold in random regular networks. In addition, the prisoner’s dilemma game is studied and the effects of clustering and degree heterogeneity on the cooperation level are discussed.