CONSTRUCTING SCALE-FREE NETWORKS WITH A GIVEN CLUSTER COEFFICIENT
Abstract
We introduce a new generation rule for local thresholding in scale-free networks based on the nodes' degree. The resulting networks are disassortative with a hierarchical structure. There is, however, a subnet of the nodes, which we call the active nodes, which is neither disassortative nor has such a structure. It is shown that networks with a wide range of cluster coefficients, ranging from very small to close to unity and with scaling exponent from 2.5 to 4 are generated by the new method, which mimic some important real-world networks.
You currently do not have access to the full text article. |
---|