Highly Clustered Complex Networks in the Configuration Model: Random Regular Small-World Network
arXiv:1911.11910 · doi:10.1209/0295-5075/128/16001
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 (31)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Assortative mixing in networks
- The large-scale organization of metabolic networks
- The structure and dynamics of multilayer networks
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Critical phenomena in complex networks
- Statistical physics of human cooperation
- Dynamical and correlation properties of the Internet
- Renormalization group analysis of the small-world network model
- Growing Scale-Free Networks with Tunable Clustering
- Scale-free topology of e-mail networks
- Evolutionary games on multilayer networks: A colloquium
- k-core organization of complex networks
- Dynamical Organization of Cooperation in Complex Topologies
- A fast Monte Carlo algorithm for site or bond percolation
- Phase diagrams for Prisoner's Dilemma game on two-dimensional lattices
- Random graphs with clustering
- Efficient Monte Carlo algorithm and high-precision results for percolation
- The physics of brain network structure, function, and control
- Mean-field solution of the small-world network model
- Growing Scale-Free Networks with Small World Behavior
- Cooperation in noisy case: prisoner's dilemma game on two types of regular random graphs
- Citation Networks in High Energy Physics
- Multiple percolation transitions in a configuration model of network of networks
- Complex Networks from Classical to Quantum
- Cooperation in spatial Prisoner's Dilemma with two types of players for increasing number of neighbors
- Distance distribution in configuration model networks
- General expression for the component size distribution in infinite configuration networks
- Newman-Ziff algorithm for the bootstrap percolation: application to the Archimedean lattices