12 citations · 41 across the 13 of their papers we have counts for
15 papers
Probabilistic analysis of arithmetic coding showing its robustness
Hosam M. Mahmoud, Hans J. Rivertz
We probabilistically analyze the performance of the arithmetic coding algorithm under a probability model for binary data in which a message is received by a coder from a source em…
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…
The containment profile of hyperrecursive trees
Joshua Sparks, Srinivasan Balaji, Hosam Mahmoud
We investigate vertex levels of containment in a random hypergraph grown in the spirit of a recursive tree. We consider a local profile tracking the evolution of the containment of…
The degree Gini index of several classes of random trees and their poissonized counterparts---an evidence for a duality theory
Carly Domicolo, Panpan Zhang, Hosam Mahmoud
There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional ev…
Distributions in the constant-differentials Pólya process
Hosam M. Mahmoud, Panpan Zhang
We study a class of unbalanced constant-differentials Pólya processes on white and blue balls. We show that the number of white balls, the number of blue balls, and the total numbe…