pith. sign in

arxiv: cond-mat/0408110 · v1 · submitted 2004-08-05 · ❄️ cond-mat.dis-nn

Generation of uncorrelated random scale-free networks

classification ❄️ cond-mat.dis-nn
keywords networksmodelscale-freedegreerandomuncorrelatedcheckvertices
0
0 comments X
read the original abstract

Uncorrelated random scale-free networks are useful null models to check the accuracy an the analytical solutions of dynamical processes defined on complex networks. We propose and analyze a model capable to generate random uncorrelated scale-free networks with no multiple and self-connections. The model is based on the classical configuration model, with an additional restriction on the maximum possible degree of the vertices. We check numerically that the proposed model indeed generates scale-free networks with no two and three vertex correlations, as measured by the average degree of the nearest neighbors and the clustering coefficient of the vertices of degree $k$, respectively.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.