Answers are grounded in this paper and cite their sources.
The theme in this paper is a composition of random graphs and Pólya urns. The random graphs are generated through a small structure called the seed. Via Pólya urns, we study the asymptotic degree structure in a random m-ary hooking network and identify strong laws. We further upgrade the result to second-order asymptotics in the form of multivariate Gaussian limit laws. We give a few concrete examples and explore some properties with a full representation of the Gaussian limit in each case. The asymptotic covariance matrix associated with the Pólya urn is obtained by a new method that originated in this paper and is reported in {Mahmoud2022}.
No takes yet. Share an insight, caveat, or question.
Bhutani et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: