Characterization and enumeration of certain classes of tenable Pólya urns grown by drawing multisets of balls

DOI10.1007/s11009-014-9421-8zbMath1339.05007OpenAlexW2034917569MaRDI QIDQ292348

Hosam M. Mahmoud, Scott R. Konzem

Publication date: 8 June 2016

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-014-9421-8

zbMATH Keywords

random structureenumerationPólya urn

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)

Related Items (2)

A generalized urn with multiple drawing and random addition ⋮ On martingale tail sums in affine two-color urn models with multiple drawings

Cites Work

• Probabilistic analysis of bucket recursive trees
• A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits
• Analysis of a generalized Friedman's urn with multiple drawings
• DRAWING MULTISETS OF BALLS FROM TENABLE BALANCED LINEAR URNS
• The Class of Tenable Zero-Balanced Pólya Urn Schemes: Characterization and Gaussian Phases
• Polya Urn Models
• On the structure of random plane‐oriented recursive trees and their branches
• A new urn model
• A simple urn model
• A limit law for outputs in random recursive circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterization and enumeration of certain classes of tenable Pólya urns grown by drawing multisets of balls