Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Pavlov Yu. L., “Maksimalnoe derevo sluchainogo lesa v konfiguratsionnom grafe”, Matem. sb., 212:9 (2021), 146–163 | DOI | MR | Zbl
[2] Pavlov Yu. L., Cheplyukova I. A., “Ob'emy derevev sluchainogo lesa i konfiguratsionnye grafy”, Trudy MIAN, 316 (2022), 298–315 | DOI | Zbl
[3] Pavlov Yu. L., “O maksimalnom ob'eme dereva sluchainogo lesa”, Diskretnaya matematika, 34:4 (2022), 69–83 | DOI
[4] Hofstad R., Random Graphs and Complex Networks, v. 1, Cambridge Univ. Press, Cambridge, 2017, 328 pp. | Zbl
[5] Khvorostyanskaya E. V., “O maksimalnom ob'eme dereva sluchainogo lesa”, Diskretnaya matematika, 34:2 (2022), 69–83 | DOI
[6] Kolchin V. F., Sluchainye otobrazheniya, Nauka, M., 1984, 207 pp.
[7] Arratia R., Barbour A. D., Tavare S., Logarithmic Combinatorial Structures: a Probabilistic Approach, EMS, Zurich, 2003, 375 pp. | MR | Zbl
[8] Feller V., Vvedenie v teoriyu veroyatnostei i ee primeneniya, v. 2, Mir, M., 1984, 752 pp. | MR
[9] Ibragimov I. A., Linnik Yu. V., Nezavisimye i statsionarno svyazannye velichiny, Nauka, M., 1965, 524 pp.
[10] Pavlov Yu. L., Sluchainye lesa, Karelskii nauchnyi tsentr RAN, Petrozavodsk, 1996, 259 pp.
[11] Bingman N. H., Goldia C. M., Teugels J. L., Regular Variation, Cambridge Univ. Press, Cambridge, 1987, 511 pp. | MR