Strong Laws for Balanced Triangular Urns
From MaRDI portal
Abstract: Consider an urn model whose replacement matrix is triangular, has all entries nonnegative and the row sums are all equal to one. We obtain the strong laws for the counts of balls corresponding to each color. The scalings for these laws depend on the diagonal elements of a rearranged replacement matrix. We use the strong laws obtained to study further behavior of certain three color urn models.
Recommendations
- Strong laws for urn models with balanced replacement matrices
- Limit theorems for triangular urn schemes
- Limit Theorems for Random Triangular URN Schemes
- A strong law of large numbers for triangular mixingale arrays
- Explicit characterization of moments of balanced triangular Pólya urns by an elementary approach
- scientific article; zbMATH DE number 694915
- Strong laws of large numbers for triangular arrays of exchangeable random variables
- On some explicit results for the balanced generalized Pólya urn
- A strict inequality for the random triangle model.
Cites work
Cited in
(8)- Negatively reinforced balanced urn schemes
- Explicit characterization of moments of balanced triangular Pólya urns by an elementary approach
- Strong laws for urn models with balanced replacement matrices
- Multiple drawing multi-colour urns by stochastic approximation
- A new approach to Pólya urn schemes and its infinite color generalization
- Strong convergence of infinite color balanced urns under uniform ergodicity
- Balanced multicolour Pólya urns via smoothing systems analysis
- Linear de-preferential urn models
This page was built for publication: Strong Laws for Balanced Triangular Urns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321770)