Random Graphs as Building Blocks for a Network Model

摘要

We introduce a new network model, based on a modification of the Newman-Strogatz-Watts model, that shows greatly increased clustering, and consequently much better agreement with the real networks, while preserving the small-world property. We study this model with computer simulation and find a numerically exact solution for its properties.