Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T09:18:47.827Z Has data issue: false hasContentIssue false

Average-Case Analysis of Cousins in m-ary Tries

Published online by Cambridge University Press:  14 July 2016

Hosam M. Mahmoud*
Affiliation:
The George Washington University
Mark Daniel Ward*
Affiliation:
Purdue University
*
∗ Postal address: Department of Statistics, The George Washington University, 2140 Pennsylvania Avenue NW, Washington, DC 20052, USA. Email address: hosam@gwu.edu
∗∗ Postal address: Department of Statistics, Purdue University, 150 North University Street, West Lafayette, IN 47907-1451, USA. Email address: mdw@purdue.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We investigate the average similarity of random strings as captured by the average number of ‘cousins’ in the underlying tree structures. Analytical techniques including poissonization and the Mellin transform are used for accurate calculation of the mean. The string alphabets we consider are m-ary, and the corresponding trees are m-ary trees. Certain analytic issues arise in the m-ary case that do not have an analog in the binary case.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2008