Central limit theorems for multicolor urns with dominated colors
From MaRDI portal
(Redirected from Publication:983172)
Abstract: An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some statistical applications are discussed.
Recommendations
- Central limit theorems for a class of irreducible multicolor urn models
- A functional central limit theorem for a class of urn models
- Central and functional central limit theorems for a class of urn models
- The class of tenable zero-balanced Pólya urns with an initially dominant subset of colors
- An urn model with random multiple drawing and random addition
Cites work
- scientific article; zbMATH DE number 3723610 (Why is no real title available?)
- A Strong Form of Stable Convergence
- A central limit theorem and its applications to multicolor randomly reinforced urns
- A central limit theorem, and related results, for a two-color randomly reinforced urn
- A randomly reinforced urn
- A survey of random processes with reinforcement
- Asymptotics in randomized urn models
- Asymptotics in response-adaptive designs generated by a two-color, randomly reinforced urn
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Limit theorems for a class of identically distributed random variables.
- Limit theorems for triangular urn schemes
- Vertex-reinforced random walk on \(\mathbb Z\) has finite range
Cited in
(16)- Statistical properties of two-color randomly reinforced urn design targeting fixed allocations
- scientific article; zbMATH DE number 4174000 (Why is no real title available?)
- scientific article; zbMATH DE number 4090452 (Why is no real title available?)
- Asymptotic properties of multicolor randomly reinforced Pólya urns
- An urn model with random multiple drawing and random addition
- Fluctuation theorems for synchronization of interacting Pólya's urns
- On the number of colored balls from a fixed set in a multi-color urn scheme without return
- Infinite-color randomly reinforced urns with dominant colors
- On maximal quantity of particles of one color in analogs of multicolor urn schemes
- Multicolor urn models with reducible replacement matrices
- Information in a two-stage adaptive optimal design
- On the distribution of the limit proportion for a two-color, randomly reinforced urn with equal reinforcement distributions
- A central limit theorem and its applications to multicolor randomly reinforced urns
- Fluctuations of balanced urns with infinitely many colours
- Strong convergence of infinite color balanced urns under uniform ergodicity
- Strong limit theorems in the multi-color generalized allocation scheme
This page was built for publication: Central limit theorems for multicolor urns with dominated colors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983172)