A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits

DOI10.1007/s11749-012-0292-4zbMath1262.60025OpenAlexW2075254133MaRDI QIDQ1945055

Henar Urmeneta, José A. Moler, Fernando Plo

Publication date: 2 April 2013

Published in: Test (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11749-012-0292-4

zbMATH Keywords

acyclic directed graphsgeneralized Pólya urn modelrandom circuits

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Graph theory (including graph drawing) in computer science (68R10) Strong limit theorems (60F15) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Two-color balanced affine urn models with multiple drawings ⋮ Characterization and enumeration of certain classes of tenable Pólya urns grown by drawing multisets of balls ⋮ On nodes of small degrees and degree profile in preferential dynamic attachment circuits ⋮ Analysis of a generalized Friedman's urn with multiple drawings ⋮ Asymptotics in random recursive circuits ⋮ On martingale tail sums in affine two-color urn models with multiple drawings

Cites Work

• Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees
• Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing
• The size of random bucket trees via urn models
• Generalizations of Polya's urn problem
• Time to absorption in discounted reinforcement models.
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Necklace Processes Via Pólya Urns
• On the Expected Depth of Random Circuits
• Strong convergence of proportions in a multicolor Pólya urn
• Central limit theorems for generalized Pólya urn models
• A limit law for outputs in random recursive circuits

This page was built for publication: A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits