Networks with desired correlations
Statistical Mechanics
2007-05-23 v2
Abstract
We discuss a simple method of constructing correlated random networks, which was recently proposed by M. Bogu~n'a and R. Pastor-Satorras (cond-mat/0306072). The result of this construction procedure is a sparse network whose degree--degree distribution asymptotically approaches a given function at large degrees. We argue that this convergence is possible if the desired function is sufficiently slowly decreasing.
Keywords
Cite
@article{arxiv.cond-mat/0308336,
title = {Networks with desired correlations},
author = {S. N. Dorogovtsev},
journal= {arXiv preprint arXiv:cond-mat/0308336},
year = {2007}
}
Comments
2 pages, rewritten taking into account that this algorithm was proposed by Bogu~n'a and Pastor-Satorras (cond-mat/0306072)