The subtree size profile of plane-oriented recursive trees

Michael Fuchs*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

In this extended abstract, we outline how to derive limit theorems for the number of subtrees of size k on the fringe of random plane-oriented recursive trees. Our proofs are based on the method of moments, where a complex-analytic approach is used for constant k and an elementary approach for A; which varies with n. Our approach is of some generality and can be applied to other simple classes of increasing trees as well.

Original languageEnglish
Title of host publication8th Workshop on Analytic Algorithmics and Combinatorics 2011, ANALCO 2011
PublisherSociety for Industrial and Applied Mathematics Publications
Pages85-92
Number of pages8
ISBN (Electronic)9781617823152
DOIs
StatePublished - 1 Jan 2011
Event8th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2011 - San Francisco, United States
Duration: 22 Jan 2011 → …

Publication series

Name8th Workshop on Analytic Algorithmics and Combinatorics 2011, ANALCO 2011

Conference

Conference8th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2011
CountryUnited States
CitySan Francisco
Period22/01/11 → …

Fingerprint Dive into the research topics of 'The subtree size profile of plane-oriented recursive trees'. Together they form a unique fingerprint.

  • Cite this

    Fuchs, M. (2011). The subtree size profile of plane-oriented recursive trees. In 8th Workshop on Analytic Algorithmics and Combinatorics 2011, ANALCO 2011 (pp. 85-92). (8th Workshop on Analytic Algorithmics and Combinatorics 2011, ANALCO 2011). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611973013.10