Refined asymptotics for the composition of cyclic urns
From MaRDI portal
Publication:1722011
DOI10.1214/18-EJP243zbMath1406.60043arXiv1612.08930MaRDI QIDQ1722011
Publication date: 14 February 2019
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.08930
weak convergencecyclic groupprobability metricPólya urnperiodicitiesZolotarev metricCLT analoguecyclic urn
Central limit and other weak theorems (60F05) Strong limit theorems (60F15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trickle-down processes and their boundaries
- An algebraic approach to Pólya processes
- Limit theorems for certain branching random walks on compact groups and homogeneous spaces
- Smoothing equations for large Pólya urns
- A general limit theorem for recursive algorithms and combinatorial structures
- Search trees: metric aspects and strong limit theorems
- A functional limit theorem for the profile of search trees
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Phase changes in randomm-ary search trees and generalized quicksort
- Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract)
- Pólya Urns Via the Contraction Method
- Phase changes in random point quadtrees
- Refined quicksort asymptotics
- The CLT Analogue for Cyclic Urns
- Bernard Friedman's Urn
This page was built for publication: Refined asymptotics for the composition of cyclic urns
