How to construct a correlated net

Simple item page
dc.creatorDorogovtsev, S. N.
dc.creatorMendes, J. F. F.
dc.creatorSamukhin, A. N.
dc.date2002-06-09
dc.date.accessioned2026-07-07T02:45:47Z
dc.date.available2026-07-07T02:45:47Z
dc.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.
dc.description2 pages, a brief communication
dc.identifierhttps://arxiv.org/abs/cond-mat/0206131
dc.identifierhttp://arxiv.org/abs/cond-mat/0206131
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/19425
dc.subjectStatistical Mechanics
dc.titleHow to construct a correlated net
dc.typetext

Files

Collections

arXiv