Asymptotics for Reinforced Stochastic Processes on Hierarchical Networks

Abstract

In this paper, we analyze the asymptotic behavior of a system of interacting reinforced stochastic processes ( Zn, Nn)n on a directed network of N agents. The system is defined by the coupled dynamics Zn+1=(1-rn) Zn+rn Xn+1 and Nn+1=(1-1n+1) Nn+1n+1 Xn+1, where agent actions P(Xn+1,j=1 Fn)=Σh whjZnh are governed by a column-normalized adjacency matrix W, and rn cn-γ with γ ∈ (1/2, 1]. Existing asymptotic theory has largely been restricted to irreducible and diagonalizable W. We extend this analysis to the broader and more practical class of reducible and non-diagonalizable matrices W possessing a block upper-triangular form, which models hierarchical influence. We first establish synchronization, proving ( Zn, Nn) Z∞ 1 almost surely, where the distribution of the limit Z∞ is shown to be determined solely by the internal dynamics of the leading subgroup. Furthermore, we establish a joint central limit theorem for ( Zn, Nn)n, revealing how the spectral properties and Jordan block structure of W govern second-order fluctuations. We demonstrate that the convergence rates and the limiting covariance structure exhibit a phase transition dependent on γ and the spectral properties of W. Crucially, we explicitly characterize how the non-diagonalizability of W fundamentally alters the asymptotic covariance and introduces new logarithmic scaling factors in the critical case (γ=1). These results provide a probabilistic foundation for statistical inference on such hierarchical network structures.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…