Hosam M. Mahmoud

Hosam M. Mahmoud

Auto-generated profile, based on publicly available information

Hosam M. Mahmoud

The George Washington University

Research Focus & Metrics

Academic Career Length

41Years (1986-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 June 2008
Verified
Book
Closed access
PDF file
HMHosam Mahmoud
Hosam Mahmoud
Incorporating a collection of recent results, Polya Urn Models deals with discrete probability through the modern and evolving urn theory and its numerous applications. It looks at how some classical problems of discrete probability have roots in urn models. The book covers the Polya-Eggenberger, Bernard Friedman's, the Bagchi-Pal, and the Ehrenfest urns. It also explains the processes of poissonization and depoissonization and presents applications to random trees, evolution, competitive exclusion, epidemiology, clinical trials, and random circuits. The text includes end-of-chapter exercises that range from easy to challenging, along with solutions in the back of the book.

1 January 1993 in Random Structures & Algorithms
Verified
Journal Article
Closed access
PDF file
HMHosam M. Mahmoud
Hosam M. Mahmoud
RSR. T. Smythe
R. T. Smythe
JSJerzy Szymański
Jerzy Szymański

1 March 1989 in Journal of Algorithms
Verified
Journal Article
Closed access
HMHosam M Mahmoud
Hosam M Mahmoud
BPBoris Pittel
Boris Pittel

1 January 1991 in Probability in the Engineering and Informational Sciences
Verified
Journal Article
Closed access
PDF file
HMHosam M. Mahmoud
Hosam M. Mahmoud
The depth of insertion and the internal path length of recursive trees are studied. Luc Devroye has recently shown that the depth of insertion in recursive trees is asymptotically normal. We give a direct alternative elementary proof of this fact. Furthermore, via the theory of martingales, we show thatIn, the internal path length of a recursive tree of ordern, converges to a limiting distribution. In fact, we show that there exists a random variableIsuch that (In–nIn n)/n→Ialmost surely and in quadratic mean, asn→ α. The method admits, in passing, the calculation of the first two moments ofIn.

1 November 1996 in The Annals of Applied Probability
Verified
Journal Article
Open access
JFJames Allen Fill
James Allen Fill
HMHosam M. Mahmoud
Hosam M. Mahmoud
WSWojciech Szpankowski
Wojciech Szpankowski
We investigate the duration of an elimination process for identifying a winner by coin tossing or, equivalently, the height of a random incomplete trie. Applications of the process include the election of a leader in a computer network. Using direct probabilistic arguments we obtain exact expressions for the discrete distribution and the moments of the height. Elementary approximation techniques then yield asymptotics for the distribution. We show that no limiting distribution exists, as the asymptotic expressions exhibit periodic fluctuations. In many similar problems associated with digital trees, no such exact expressions can be derived. We therefore outline a powerful general approach, based on the analytic techniques of Mellin transforms, Poissonization and de-Poissonization, from which distributional asymptotics for the height can also be derived. In fact, it was this complex variables approach that led to our original discovery of the exact distribution. Complex analysis methods are indispensable for deriving asymptotic expressions for the mean and variance, which also contain periodic terms of small magnitude.

1 August 1992 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
HMHosam M. Mahmoud
Hosam M. Mahmoud