Random additions in urns of integers

DOI10.1017/jpr.2020.90zbMath1476.60018arXiv1908.01370MaRDI QIDQ4997192

Mackenzie Simper

Publication date: 28 June 2021

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.01370

zbMATH Keywords

contraction method; urn model; recursive distributional equation; exponential limit law

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

60C05: Combinatorial probability

Related Items

Double coset Markov chains

Cites Work

• Unnamed Item
• Inventing new signals
• Random multiplication approaches uniform measure in finite groups
• A survey of random processes with reinforcement
• Note on a characterization of exponential distributions
• Some asymptotic theory for the bootstrap
• Ferguson distributions via Polya urn schemes
• A general limit theorem for recursive algorithms and combinatorial structures
• A.s. convergence for infinite colour Pólya urns associated with random walks
• Two-color balanced affine urn models with multiple drawings
• Pólya urn schemes with infinitely many colors
• Analysis of a generalized Friedman's urn with multiple drawings
• An urn model of Diaconis
• On a multivariate contraction method for random recursive structures with applications to Quicksort
• Pólya Urns Via the Contraction Method
• Polya Urn Models
• Probability with Martingales
• Multiple drawing multi-colour urns by stochastic approximation
• Probability metrics and recursive algorithms
• A limit theorem for “quicksort”