The size of random bucket trees via urn models

DOI10.1007/S00236-002-0096-1zbMATH Open1034.68121OpenAlexW4247377412MaRDI QIDQ1403333FDOQ1403333

Hosam M. Mahmoud

Publication date: 1 September 2003

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-002-0096-1

Recommendations

• Pólya urn models and connections to random trees: a review
• Probabilistic analysis of bucket recursive trees
• B-urns
• Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
• Pólya urns via the contraction method

zbMATH Keywords

nonclassic Pólya urn models

Mathematics Subject Classification ID

Randomized algorithms (68W20) Data structures (68P05)

Cited In (10)

• Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates
• Random sprouts as internet models, and Pólya processes
• Title not available (Why is that?)
• Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Exact and limiting distributions in diagonal Pólya processes
• A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits
• Central limit theorems for generalized Pólya urn models
• Asymptotics in random recursive circuits
• Distributions in the Ehrenfest process

This page was built for publication: The size of random bucket trees via urn models

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