Abstract
Consider an urn model whose replacement matrix is triangular, has all nonnegative entries, and the row sums are all equal to 1. We obtain 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 these strong laws to study further behavior of certain three-color urn models.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
