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 the properties of them. 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.

6 pages, 5 figures

References in corpus (9)

• The structure and dynamics of multilayer networks
• Critical phenomena in complex networks
• Statistical physics of human cooperation
• Evolutionary games on multilayer networks: A colloquium
• Dynamical Organization of Cooperation in Complex Topologies
• Random graphs with clustering
• Cooperation in noisy case: prisoner's dilemma game on two types of regular random graphs
• Cooperation in spatial Prisoner's Dilemma with two types of players for increasing number of neighbors
• Newman-Ziff algorithm for the bootstrap percolation: application to the Archimedean lattices