Distribution of inter-node distances in digital trees

MaRDI QIDQ5485347zbMATH OpenFDO

Authors Rafik Aguech, Nabil Lasmar, Hosam M. Mahmoud

Publication date 29 August 2006

zbMATH Keywords

contraction methodfixed pointMellin transformPoissonizationrandom treesrecurrence

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Data structures (68P05)

Recommendations

• Distances in random digital search trees
• Limit distribution of distances in biased random tries
• scientific article; zbMATH DE number 849078
• The variance of the profile in digital search trees
• Imbalance in random digital trees

Cited in

(10)

• Imbalance in random digital trees
• On the variety of shapes in digital trees
• Renewals for exponentially increasing lifetimes, with an application to digital search trees
• The k-th total path length and the total Steiner k-distance for digital search trees
• Limit distribution of distances in biased random tries
• On the distribution of distances in recursive trees
• 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6--10, 2005.
• The oscillatory distribution of distances in random tries
• Node profiles of symmetric digital search trees: Concentration properties
• Distances in random digital search trees

This page was built for publication: Distribution of inter-node distances in digital trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485347)