ON ASSORTATIVITY AND CLUSTERING OF A POWER-LAW CONFIGURATION GRAPH MODEL

Transactions of the Karelian Research Centre of the Russian Academy of Sciences

关键词: configuration graph;    power-law;    assortativity;    clustering;    simulations.;   

DOI  :  10.17076/mat1032

来源: DOAJ

【 摘 要 】

The paper deals with configuration graphs with vertex degrees distributed independently according to the power law. The distribution parameter is either fixed or randomly distributed according to either uniform or truncated normal distribution on a predefined interval (a, b). The assortativity and clustering of these
graphs are studied by computer simulation. The estimates of numerical structural characteristics are found, such as the assortativity and clustering coefficients. The obtained results are compared with those known from the literature for real world
complex networks.

【 授权许可】

Unknown