Abstract
AbstractWe study the size of the automorphism group of two different types of random trees: Galton–Watson trees and rooted Pólya trees. In both cases, we prove that it asymptotically follows a log-normal distribution and provide asymptotic formulas for the mean and variance of the logarithm of the size of the automorphism group. While the proof for Galton–Watson trees mainly relies on probabilistic arguments and a general result on additive tree functionals, generating functions are used in the case of rooted Pólya trees. We also show how to extend the results to some classes of unrooted trees.
Funder
Knut och Alice Wallenbergs Stiftelse
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. Aigner, M.: A Course in Enumeration. Graduate Texts in Mathematics, vol. 238. Springer, Berlin (2007)
2. Aldous, D.: Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25(2), 812–854 (1997). https://doi.org/10.1214/aop/1024404421
3. Babai, L.: Automorphism groups, isomorphism, reconstruction. In: Handbook of Combinatorics, vol. 2, pp. 1447–1540. Elsevier, Amsterdam (1995)
4. Bóna, M., Flajolet, P.: Isomorphism and symmetries in random phylogenetic trees. J. Appl. Probab. 46(4), 1005–1019 (2009). https://doi.org/10.1239/jap/1261670685
5. Drmota, M.: Random Trees. Springer, Vienna (2009). https://doi.org/10.1007/978-3-211-75357-6