The maximum tree of a random forest in the configuration graph

Abstract

Galton-Watson random forests with a given number of root trees and a known number of nonroot vertices are investigated. The distribution of the number of direct offspring of each particle in the forest- generating process is assumed to have infinite variance. Branching processes of this kind are used successfully to study configuration graphs aimed at simulating the structure and development dynamics of complex communication networks, in particular the internet. The known relationship between configuration graphs and random forests reflects the local tree structure of simulated networks. Limit theorems are proved for the maximum size of a tree in a random forest in all basic zones where the number of trees and the number of vertices tend to infinity. Bibliography: 14 titles.