Abstract

We complete the study of the model introduced in Crimaldi et al., (2022). It is a two-color urn model with multiple drawing and random (non-balanced) time-dependent reinforcement matrix. The number of sampled balls at each time-step is random. We identify the exact rates at which the number of balls of each color grows to +∞ and define two strongly consistent estimators for the limiting reinforcement averages. Then we prove a Central Limit Theorem, which allows to design a statistical test for such averages.

Full Text
Published version (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