44 citations · 203 across the 22 of their papers we have counts for
27 papers
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…
On solutions of the distributional Bellman equation
Julian Gerstenberg, Ralph Neininger, Denis Spiegel
In distributional reinforcement learning not only expected returns but the complete return distributions of a policy are taken into account. The return distribution for a fixed pol…
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…
Probabilistic Analysis of the Dual-Pivot Quicksort "Count"
Ralph Neininger, Jasmin Straub
Recently, Aumüller and Dietzfelbinger proposed a version of a dual-pivot quicksort, called "Count", which is optimal among dual-pivot versions with respect to the average number of…
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…