Queueing methods in the theory of random graphs
Lajos Takács · 2023
In this article several limit theorems are proved for the fluctuations of the queue size during the initial busy period of a queueing process with one server. These theorems are used to find the solutions of various problems connected with the heights and widths of random-rooted trees.