Dependence between path-length and size in random digital trees
From MaRDI portal
Publication:4684912
DOI10.1017/jpr.2017.56zbMath1397.68031arXiv1701.02397OpenAlexW2963133649MaRDI QIDQ4684912
Michael Fuchs, Hsien-Kuei Hwang
Publication date: 26 September 2018
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.02397
asymptotic normalityintegral transformcontraction methodcovariancePearson's correlation coefficienttotal path lengthPoissonizationde-Poissonizationrandom tries
Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries
- Mellin transforms and asymptotics: Harmonic sums
- On the variance of a class of inductive valuations of data structures for digital search
- Analytical depoissonization and its applications
- The multivariate normal distribution
- On The variance of the extremal path length in a symmetric digital trie
- Analytic variations on bucket selection and sorting
- Universal asymptotics for random tries and PATRICIA trees
- Dynamical sources in information theory: A general analysis of trie structures
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Asymptotic variance of random symmetric digital search trees
- Digital Search Trees Revisited
- On some applications of formulae of Ramanujan in the analysis of algorithms
- Universal Limit Laws for Depths in Random Trees
- New results on the size of tries
- Generating Random Permutations by Coin Tossing
- The Wiener Index of Random Digital Trees
- The Ubiquitous Digital Tree
- Dependence and phase changes in random m‐ary search trees
This page was built for publication: Dependence between path-length and size in random digital trees
