How to construct a correlated net

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

(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.
2 pages, a brief communication

Keywords

Statistical Mechanics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/19425

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/0206131
 http://arxiv.org/abs/cond-mat/0206131

Collections

arXiv