Home On the maximal tree in Galton–Watson forest with infinite variance of the offspring
Article
Licensed
Unlicensed Requires Authentication

On the maximal tree in Galton–Watson forest with infinite variance of the offspring

  • Yuriy L. Pavlov EMAIL logo
Published/Copyright: July 15, 2025

Abstract

Galton-Watson forests formed by a critical branching process starting with N particles are considered. The total number of descendants of the initial particles over all time of evolution is equal to n. Assume that the number of offspring of each particle has the distribution

pk=h(k+1)(k+1)τ,k=0,1,2,,τ(2,3),

where the function h(x) is slowly varying at infinity. The limit distribution of the maximum size of a tree is found if N, n → ∞ and there exist α > 0 such that n/Nτ−1+α → ∞.


Originally published in Diskretnaya Matematika (2023) 35, №2, 38–92 (in Russian).


Funding statement: The work was supported by funds from the Federal budget for the implementation of the State assignment to the KarSC RAS (Institute of Applied Mathematical Research KarSC RAS).

References

[1] Pavlov Yu. L., “The maximum tree of a random forest in the configuration graph”, Sbornik: Mathematics, 2129 (2021), 1329–1346.10.1070/SM9481Search in Google Scholar

[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.10.1134/S0081543822010205Search in Google Scholar

[3] Pavlov Yu. L., “On the maximal size of tree in a random forest”, Discrete Math. Appl., 344 (2024), 221–232.10.1515/dma-2024-0019Search in Google Scholar

[4] Hofstad R., Random Graphs and Complex Networks. V. 1, Cambridge Univ. Press, Cambridge, 2017, 328 pp.10.1017/9781316779422Search in Google Scholar

[5] Khvorostianskaia E. V., “Limit theorems for the maximal tree size of a Galton –Watson forest in the critical case”, Discrete Math. Appl., 334 (2023), 205–217.10.1515/dma-2023-0019Search in Google Scholar

[6] Kolchin V. F., Random Mappings, Optimization Software Inc. Publications Division, New York, 1986, 207 pp.Search in Google Scholar

[7] Arratia R., Barbour A. D., Tavare S., Logarithmic Combinatorial Structures: a Probabilistic Approach, EMS, Zurich, 2003, 375 pp.10.4171/000Search in Google Scholar

[8] Feller V., An introduction to probability theory and its applications. Volume II, Wiley, 1957, 704 pp.Search in Google Scholar

[9] Ibragimov I. A., Linnik Yu. V., Independent and stationary related quantities, M.: Nauka, 1965 (in Russian), 524 pp.Search in Google Scholar

[10] Pavlov Yu. L., Random Forests, Petrozavodsk: Karelian Research Centre RAS, 1996 (in Russian), 259 pp.10.1515/9783112314074-003Search in Google Scholar

[11] Bingman N. H., Goldia C. M., Teugels J. L., Regular Variation, Cambridge Univ. Press, Cambridge, 1987, 511 pp.Search in Google Scholar

Received: 2023-02-02
Published Online: 2025-07-15
Published in Print: 2025-06-26

© 2025 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 10.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dma-2025-0011/html
Scroll to top button