The shape of random tanglegrams
From MaRDI portal
Abstract: A tanglegram consists of two binary rooted trees with the same number of leaves and a perfect matching between the leaves of the trees. We show that the two halves of a random tanglegram essentially look like two independently chosen random plane binary trees. This fact is used to derive a number of results on the shape of random tanglegrams, including theorems on the number of cherries and generally occurrences of subtrees, the root branches, the number of automorphisms, and the height. For each of these, we obtain limiting probabilities or distributions. Finally, we investigate the number of matched cherries, for which the limiting distribution is identified as well.
Recommendations
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- Analytic combinatorics
- Drawing (complete) binary tanglegrams
- Isomorphism and symmetries in random phylogenetic trees
- On the enumeration of tanglegrams and tangled chains
- Random Trees
- The Distribution of Heights of Binary Trees and Other Simple Trees
- The average height of binary trees and other simple trees
Cited in
(12)- An infinite antichain of planar tanglegrams
- Inducibility in binary trees and crossings in random tanglegrams
- On trees, tanglegrams, and tangled chains
- scientific article; zbMATH DE number 7359764 (Why is no real title available?)
- Counting tanglegrams with species
- Planar tanglegram layouts and single edge insertion
- A tanglegram Kuratowski theorem
- Tangles are Decided by Weighted Vertex Sets
- Characterizing planar tanglegram layouts and applications to edge insertion problems
- Sampling planar tanglegrams and pairs of disjoint triangulations
- On the enumeration of tanglegrams and tangled chains
- The correspondence induced on the pillowcase by the earring tangle
This page was built for publication: The shape of random tanglegrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281899)
