Pólya urn models and connections to random trees: a review

zbMATH Open1499.60020MaRDI QIDQ2834317FDOQ2834317

Hosam M. Mahmoud

Publication date: 28 November 2016

Published in: Journal of the Iranian Statistical Society JIRSS (Search for Journal in Brave)

Full work available at URL: http://jirss.irstat.ir/browse.php?a_id=94&slc_lang=en&sid=1&ftxt=1

Recommendations

• The size of random bucket trees via urn models
• Polya Urn Models
• Pólya urns via the contraction method
• Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
• Using Pólya urns to show normal limit laws for fringe subtrees in \(m\)-ary search trees

zbMATH Keywords

random treesstochastic processpoissonizationPólya urns

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cited In (18)

• Large deviations for generalized Polya urns with arbitrary urn function
• On the area under lattice paths associated with triangular diminishing urn models
• Clade size distribution under neutral evolutionary models
• Title not available (Why is that?)
• Stein's Method for the Beta Distribution and the Pólya-Eggenberger Urn
• Random sprouts as internet models, and Pólya processes
• Distributions in the constant-differentials Pólya process
• Distribution of tree parameters by martingale approach
• The characterization of tenable Pólya urns
• Title not available (Why is that?)
• Exact and limiting distributions in diagonal Pólya processes
• Characterization and enumeration of certain classes of tenable Pólya urns grown by drawing multisets of balls
• On the number of increasing trees with label repetitions
• On longest paths and diameter in random apollonian networks
• The size of random bucket trees via urn models
• The Class of Tenable Zero-Balanced Pólya Urn Schemes: Characterization and Gaussian Phases
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
• Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains

This page was built for publication: Pólya urn models and connections to random trees: a review

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