Interacting generalized Friedman's urn systems
arXiv:1601.01550 · doi:10.1016/j.spa.2016.12.003
Abstract
We consider systems of interacting Generalized Friedman's Urns (GFUs) having irreducible mean replacement matrices. The interaction is modeled through the probability to sample the colors from each urn, that is defined as convex combination of the urn proportions in the system. From the weights of these combinations we individuate subsystems of urns evolving with different behaviors. We provide a complete description of the asymptotic properties of urn proportions in each subsystem by establishing limiting proportions, convergence rates and Central Limit Theorems. The main proofs are based on a detailed eigenanalysis and stochastic approximation techniques.
References in corpus (4)
Cited by in corpus (13)
- Synchronization of Reinforced Stochastic Processes with a Network-based Interaction
- Interacting reinforced stochastic processes: statistical inference based on the weighted empirical means
- Nonparametric covariate-adjusted response-adaptive design based on a functional urn model
- Dynamics of an Adaptive Randomly Reinforced Urn
- Networks of reinforced stochastic processes: asymptotics for the empirical means
- Interacting Innovation processes: case studies from Reddit and Gutenberg
- Networks of reinforced stochastic processes: a complete description of the first-order asymptotics
- Networks of reinforced stochastic processes: probability of asymptotic polarization and related general results
- Interacting Urns on Directed Networks with Node-Dependent Sampling and Reinforcement
- Urns with Multiple Drawings and Graph-Based Interaction
- Interacting non-linear reinforced stochastic processes: synchronization and no-synchronization
- Multiple colour interacting urns on complete graphs
- Central limit theorems for interacting innovation processes, related statistical tools and general results