  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.
