A note on limits of sequences of binary trees

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a characterization of the set of possible limits and its structure as a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete mathematics and theoretical computer science Ročník 25:1; číslo Analysis of Algorithms; s. 1 - 15
Hlavní autor: Grübel, Rudolf
Médium: Journal Article
Jazyk:angličtina
Vydáno: Nancy DMTCS 01.01.2023
Discrete Mathematics & Theoretical Computer Science
Témata:
05c05, 60c05, 68w40
mathematics - combinatorics
mathematics - probability
Metric space
Normality
Permutations
Search algorithms
Set theory
Sorting algorithms
Topology
Trees (mathematics)
ISSN:1365-8050, 1365-8050
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a characterization of the set of possible limits and its structure as a metric space. For random trees the subtree size topology arises in the context of algorithms for searching and sorting when applied to random input, resulting in a sequence of nested trees. For these we obtain a structural result based on a local version of exchangeability. This in turn leads to a central limit theorem, with possibly mixed asymptotic normality.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1365-8050
1365-8050
DOI:10.46298/dmtcs.10968