44 citations · 203 across the 22 of their papers we have counts for
23 papers · 1 filter
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…
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
Michael Fuchs, Cecilia Holmgren, Dieter Mitsche +1
We identify the mean growth of the independence number of random binary search trees and random recursive trees and show normal fluctuations around their means. Similarly we also s…
Node Profiles of Symmetric Digital Search Trees: Concentration Properties
Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang +1
We give a detailed asymptotic analysis of the profiles of random symmetric digital search trees, which are in close connection with the performance of the search complexity of rand…
Refined Asymptotics for the Composition of Cyclic Urns
Noela Müller, Ralph Neininger
A cyclic urn is an urn model for balls of types . The urn starts at time zero with an initial configuration. Then, in each time step, first a ball is drawn from the u…
Process convergence for the complexity of Radix Selection on Markov sources
Kevin Leckey, Ralph Neininger, Henning Sulzbach
A fundamental algorithm for selecting ranks from a finite subset of an ordered set is Radix Selection. This algorithm requires the data to be given as strings of symbols over an or…
The CLT Analogue for Cyclic Urns
Noela S. Müller, Ralph Neininger
A cyclic urn is an urn model for balls of types where in each draw the ball drawn, say of type , is returned to the urn together with a new ball of type $j+1 \mod…