Quantifying Dependence Between Random Vectors: A New Index with Applications
Abstract
This article proposes a new index for quantifying the degree of dependence between random vectors. The index takes values in [0,1] and equals zero if and only if the random vectors are sub-independent. Unlike mere uncorrelatedness, sub-independence implies a stronger form of dependence while remaining strictly weaker than full independence. The proposed index is constructed via characteristic functions and admits a simplified representation in terms of moments. We establish its theoretical properties and derive a computationally efficient formula for the corresponding empirical measure. Furthermore, we investigate the asymptotic behavior of the estimator and demonstrate its practical utility through applications in machine learning, actuarial science, and renewal theory.
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.