3 papers
math.PR2026
Distances in -ary recursive trees
Kiran Bhutani, Ravi Kalpathy, Florian Lesny +2
We introduce the -ary recursive tree, a tree structure that starts with a single node. At each step of the growth process, a random node, called the recruiter, is selected, and…
math.PR2026
On topological indices of random caterpillar graphs
Florian Lesny, Ralph Neininger, Markus Schmieder
We consider the asymptotic behaviour of topological indices of random caterpillar graphs, such as the Zagreb, -Randić, Wiener, Gini and level indices, as the size of the graph g…
math.PR2025
Probabilistic analysis of optimal multi-pivot QuickSort
Cecilia Holmgren, Jasper Ischebeck, Daniel Krenn +2
We consider a multi-pivot QuickSort algorithm using pivot elements to partition a nonsorted list into sublists in order to proceed recursively on these subli…