Affiliation:
1. Institute of Applied Mathematical Research of Karelian Research Centre RAS , Petrozavodsk Russia
Abstract
Abstract
Galton-Watson forests consisting of N rooted trees and n non-root vertices are considered. The distribution of the forest is determined by that of critical branching process with infinite variance and regularly varying tail of the progeny distribution. We prove limit theorem for the maximal size of a tree in a forest as N, n → ∞ in such a way that n/N → ∞. Our conditions are significantly wider than was previously known.
Reference10 articles.
1. Pavlov Yu. L., “The maximum tree of a random forest in the configuration graph”, Sbornik: Mathematics, 212:9 (2021), 1329–1346.
2. Pavlov Yu. L., Cheplyukova I. A., “Sizes of trees in a random forest and configuration graphs”, Proc. Steklov Inst. Math., 316 (2022), 280–297.
3. Hofstad R., Random Graphs and Complex Networks, Vol.1, Cambridge University Press, Cambridge, 2017, xvi+321 pp., Vol.2, https://www.win.tue.nl/~rhofstad/NotesRGCNII.pdf
4. Bollobas B., “A probabilistic proof of an asymptotic formula for the number of labelled regular graphs”, Eur. J. Comb., 1:4 (1980), 311–316.
5. Reittu H., Norros I., “On the power-law random graph model of massive data networks”, Performance Evaluation, 55:1-2 (2004), 3–23.