Central limit theorems for interacting innovation processes, related statistical tools and general results

Abstract

We study a networked system of innovation processes, where each process is modeled as an urn with infinitely many colors-a classical framework for capturing the emergence of novelties. Extending this paradigm, we analyze a model of interacting urns, where the probability of generating or reusing elements in one process is influenced by the histories of others. This interaction is governed by two matrices that control innovation triggering and reinforcement dynamics across the system. The core contribution of this work is a detailed analysis of the second-order asymptotic behavior of the model. Building on these theoretical results, we develop statistical tools to infer the structure and strength of inter-process influence. The methodology is framed in a general setting, making it broadly applicable. We validate our approach with applications to two real-world datasets from Reddit discussions and Gutenberg text corpora.

References in corpus (14)

• Cultural route to the emergence of linguistic categories
• Zipf's, Heaps' and Taylor's laws are determined by the expansion into the adjacent possible
• Convergence rate and averaging of nonlinear two-time-scale stochastic approximation algorithms
• Interacting discovery processes on complex networks
• Distributions of linear functionals of two parameter Poisson--Dirichlet random measures
• The Beneficial Role of Mobility for the Emergence of Innovation
• Central Limit Theorems of a Recursive Stochastic Algorithm with Applications to Adaptive Designs
• Interacting generalized Friedman's urn systems
• Interacting reinforced stochastic processes: statistical inference based on the weighted empirical means
• Infinite-color randomly reinforced urns with dominant colors
• Interacting Innovation processes: case studies from Reddit and Gutenberg
• Damping effect in innovation processes: case studies from Twitter
• Characterization of exchangeable measure-valued Pólya urn sequences
• Networks of reinforced stochastic processes: a complete description of the first-order asymptotics