Browsing by Author "Ralaivaosaona, Dimbinaina"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Limit theorems for integer partitions and their generalisations
    (Stellenbosch : Stellenbosch University, 2012-03) Ralaivaosaona, Dimbinaina; Wagner, Stephan; Stellenbosch University. Faculty of Science. Dept. of Mathematical Sciences.
    ENGLISH ABSTRACT: Various properties of integer partitions are studied in this work, in particular the number of summands, the number of ascents and the multiplicities of parts. We work on random partitions, where all partitions from a certain family are equally likely, and determine moments and limiting distributions of the different parameters. The thesis focuses on three main problems: the first of these problems is concerned with the length of prime partitions (i.e., partitions whose parts are all prime numbers), in particular restricted partitions (i.e., partitions where all parts are distinct). We prove a central limit theorem for this parameter and obtain very precise asymptotic formulas for the mean and variance. The second main focus is on the distribution of the number of parts of a given multiplicity, where we obtain a very interesting phase transition from a Gaussian distribution to a Poisson distribution and further to a degenerate distribution, not only in the classical case, but in the more general context of ⋋-partitions: partitions where all the summands have to be elements of a given sequence ⋋ of integers. Finally, we look into another phase transition from restricted to unrestricted partitions (and from Gaussian to Gumbel-distribution) as we study the number of summands in partitions with bounded multiplicities.
  • Thumbnail Image
    Item
    On the distribution of subtree orders of a tree
    (University of Primorska, 2018) Ralaivaosaona, Dimbinaina; Wagner, Stephan
    We investigate the distribution of the number of vertices of a randomly chosen subtree of a tree. Specifically, it is proven that this distribution is close to a Gaussian distribution in an explicitly quantifiable way if the tree has sufficiently many leaves and no long branchless paths. We also show that the conditions are satisfied asymptotically almost surely for random trees. If the conditions are violated, however, we exhibit by means of explicit counterexamples that many other (non-Gaussian) distributions can occur in the limit. These examples also show that our conditions are essentially best possible.