arXiv · cond-mat/0206131
How to construct a correlated net
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
S. N. Dorogovtsev, J. F. F. Mendes, A. N. Samukhin. 2002-06-09. How to construct a correlated net. https://arxiv.org/abs/cond-mat/0206131
Cite the original work for its findings. Save a collection to share your selection of sources.