Journal article Open Access
Dong-Uk Hwang; Vito Latora; Stefano Boccaletti
We introduce a fully nonhierarchical network growing mechanism, that furthermore does not impose explicit preferential attachment rules. The growing procedure produces a graph featuring power-law degree and clustering distributions, and manifesting slightly disassortative degree-degree correlations. The rigorous rate equations for the evolution of the degree distribution and for the conditional degree-degree probability are derived.
Name | Size | |
---|---|---|
fulltext.pdf
md5:20dc27e5454068a1bb1e40ce76fd49d3 |
218.2 kB | Download |
Views | 0 |
Downloads | 0 |
Data volume | 0 Bytes |
Unique views | 0 |
Unique downloads | 0 |