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

@article{Jeong2019HighlyCC,
  title={Highly clustered complex networks in the configuration model: Random regular small-world network},
  author={Wonhee Jeong and Hoseung Jang and Unjong Yu},
  journal={Europhysics Letters},
  year={2019},
  volume={128}
}
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… 
Critical phenomena and strategy ordering with hub centrality approach in the aspiration-based coordination game.
TLDR
The difference of network structures in model and real-world networks induces qualitatively different behavior in the coordination game, and it is found that the critical selection noise decreases with clustering in random regular graphs.
Universal behaviour of the growth method and importance of local hubs in cascading failure
TLDR
Through the study of a targeted attack and overload cascading failure, it is proved that hub centrality is a meaningful parameter that gives extra insight beyond degree in real-world networks.
Evolution of cooperation in multi-agent systems with time-varying tags, multiple strategies, and heterogeneous invasion dynamics
TLDR
This model of the evolution of cooperation in an ageing population of artificial decision makers playing spatial tag-mediated prisoner’s dilemma games with their ingroup neighbors and with genetically unrelated immigrant agents is developed and suggests that in an open system subject to immigration dynamics, high levels of social cooperation can be attained.

References

SHOWING 1-6 OF 6 REFERENCES
An Evolving Scale-free Network with Large Clustering Coefficient
  • Peihua Fu, Kun-Chi Liao
  • Computer Science
    2006 9th International Conference on Control, Automation, Robotics and Vision
  • 2006
TLDR
The relatively preferential attachment (RPA) method, which considers preferential attachment as well as the probability channel, can produce networks which not only keep the scale free property but also have high clustering coefficient close to those of real networks.
Evolving Small-World Networks based on the Modified BA Model
  • Jianwei Wang, Lili Rong
  • Computer Science
    2008 International Conference on Computer Science and Information Technology
  • 2008
TLDR
The simulation results show the modified BA model may provide a satisfactory description for empirical characteristics of real networks, since most real networks are both scale-free and small-world networks.
Random Graphs as Models of Networks
The random graph of Erdos and Renyi is one of the oldest and best studied models of a network, and possesses the considerable advantage of being exactly solvable for many of its average properties.
Robustness in large-scale random networks
We consider the issue of protection in very large networks displaying randomness in topology. We employ random graph models to describe such networks, and obtain probabilistic bounds on several
Introduction To Percolation Theory
Preface to the Second Edition Preface to the First Edition Introduction: Forest Fires, Fractal Oil Fields, and Diffusion What is percolation? Forest fires Oil fields and fractals Diffusion in
Random graphs 2nd Edition (Cambridge university
  • 2001