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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics and theoretical computer science Jg. 25:1; H. Analysis of Algorithms; S. 1 - 15
1. Verfasser: Grübel, Rudolf
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Nancy DMTCS 01.01.2023
Discrete Mathematics & Theoretical Computer Science
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1365-8050
1365-8050
DOI:10.46298/dmtcs.10968