Networks with desired correlations
| dc.creator | Dorogovtsev, S. N. | |
| dc.date | 2003-08-17 | |
| dc.date | 2003-08-25 | |
| dc.date.accessioned | 2026-07-07T02:52:57Z | |
| dc.date.available | 2026-07-07T02:52:57Z | |
| dc.description | 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. | |
| dc.description | 2 pages, rewritten taking into account that this algorithm was proposed by Bogu~n'a and Pastor-Satorras (cond-mat/0306072) | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0308336 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0308336 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/22030 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Networks with desired correlations | |
| dc.type | text |