Convergence to limit distributions in models of growing random networks
Dalʹnevostočnyj matematičeskij žurnal, Tome 14 (2014) no. 1, pp. 100-108
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
Asymptotics of differences between limit and prelimit node degree distributions in models of growing random networks are constructed. The rates of convergence, up to logarithmic factors, have power estimates.
[1] L. A. Barabasi, R. Albert, “Emergence of scaling in random networks”, Science, 286 (1999), 509–512 | DOI | MR | Zbl
[2] S. N. Dorogovtsev, J. F. Mendes, “Evolution of Networks”, Adv. Phys., 51:4 (2002), 1079–1187 | DOI
[3] S. L. Ginzburg, “Vliyanie struktury slozhnoi seti na svoistva dinamicheskikh protsessov na nei”, Pisma v ZhETF, 90:12 (2009), 873–878
[4] I. A. I.A. Evin, “Vvedenie v teoriyu slozhnykh setei”, Kompyuternye issledovaniya i modelirovanie, 2:2 (2010), 121–141
[5] A. M. Raigorodskii, “Modeli sluchainykh grafov i ikh primenenie”, Trudy MFTI, 2:4 (2010), 130–140 | MR