Semantic Scholar Open Access 2003 5 sitasi

Networks with desired correlations

S. Dorogovtsev

Abstrak

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.

Topik & Kata Kunci

Penulis (1)

S

S. Dorogovtsev

Format Sitasi

Dorogovtsev, S. (2003). Networks with desired correlations. https://www.semanticscholar.org/paper/d46d287156c644e792e427d211eaea09428fae21

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →
Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2003
Bahasa
en
Total Sitasi
Sumber Database
Semantic Scholar
Akses
Open Access ✓