Miklós Bóna - On the number of vertices of each rank in phylogenetic trees and their generalizations

dmtcs:653 - Discrete Mathematics & Theoretical Computer Science, April 11, 2016, Vol. 18 no. 3 - https://doi.org/10.46298/dmtcs.653
On the number of vertices of each rank in phylogenetic trees and their generalizations

Authors: Miklós Bóna

    We find surprisingly simple formulas for the limiting probability that the rank of a randomly selected vertex in a randomly selected phylogenetic tree or generalized phylogenetic tree is a given integer.

    https://doi.org/10.46298/dmtcs.653
    Source: arXiv.org:1505.07437
    Volume: Vol. 18 no. 3
    Section: Combinatorics
    Published on: April 11, 2016
    Submitted on: April 11, 2016
    Keywords: Mathematics - Combinatorics,05A15, 05A16
    Licence: arXiv.org - Non-exclusive license to distribute

    Linked publications - datasets - softwares

    Source : ScholeXplorer IsRelatedTo DOI 10.1002/rsa.3240050207
    • 10.1002/rsa.3240050207
    Note on the heights of random recursive trees and random m ‐ary search trees

    Share and export

    Consultation statistics

    This page has been seen 618 times.
    This article's PDF has been downloaded 330 times.