2 citations · 2 across the 3 of their papers we have counts for
4 papers
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…
Degrees in random -ary hooking networks
Kiran R. Bhutani, Ravi Kalpathy, Hosam Mahmoud
The theme in this paper is a composition of random graphs and Pólya urns. The random graphs are generated through a small structure called the seed. Via Pólya urns, we study the as…
Random multi-hooking networks
Kiran R. Bhutani, Ravi Kalpathy, Hosam Mahmoud
We introduce a broad class of multi-hooking networks, wherein multiple copies of a seed are hooked at each step at random locations, and the number of copies follows a predetermine…
Degree profile of -ary search trees: A vehicle for data structure compression
Ravi Kalpathy, Hosam Mahmoud
We revisit the random -ary search tree and study a finer profile of its node outdegrees with the purpose of exploring possibilities of data structure compression. The analysis i…