How to construct a correlated net
Statistical Mechanics
2007-05-23 v1
Abstract
(a) We propose a ``static'' construction procedure for random networks with given correlations of the degrees of the nearest-neighbor vertices. This is an equilibrium graph, maximally random under the constraint that its degree-degree distribution is fixed. (b) We generalize the notion of preferential linking and introduce a new category, {\em pair preference} and a pair preference function for the attaching of edges to pairs of vertices. This allows dynamically generate equilibrium correlated networks.
Cite
@article{arxiv.cond-mat/0206131,
title = {How to construct a correlated net},
author = {S. N. Dorogovtsev and J. F. F. Mendes and A. N. Samukhin},
journal= {arXiv preprint arXiv:cond-mat/0206131},
year = {2007}
}
Comments
2 pages, a brief communication